Other formats:
BibTeX
LaTeX
RIS
@inproceedings{25021, author = {Antoš, Karel}, address = {Liberec}, booktitle = {Proceedings of International Conference Presentation of Mathematics `14}, edition = {1. vyd.}, keywords = {graph theory; minimum spanning tree; Joseph Kruskal; reverse algorithm}, howpublished = {paměťový nosič}, language = {eng}, location = {Liberec}, isbn = {978-80-7494-108-5}, pages = {7-16}, publisher = {Technická univerzita v Liberci}, title = {Problem of searching minimum spanning tree}, year = {2014} }
TY - JOUR ID - 25021 AU - Antoš, Karel PY - 2014 TI - Problem of searching minimum spanning tree PB - Technická univerzita v Liberci CY - Liberec SN - 9788074941085 KW - graph theory KW - minimum spanning tree KW - Joseph Kruskal KW - reverse algorithm N2 - This article provides solutions to certain models of graph theory, where the minimum spanning tree (MST) models are suitable. The principle of the MST problem is the fact that it is necessary to find the model situations for which this method is suitable, to find how to use this method in finding a solution, and finally to compare two methods of looking for the MST, in terms of their different approaches, their complementarity, and their assessment, which of these two methods can find a feasible solution faster in particular cases. A theoretical discussion and a model example are carried out to compare the two methods. ER -
ANTOŠ, Karel. Problem of searching minimum spanning tree. In \textit{Proceedings of International Conference Presentation of Mathematics `14}. 1. vyd. Liberec: Technická univerzita v Liberci, 2014, p.~7-16. ISBN~978-80-7494-108-5.
|