Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{27521, author = {Antoš, Karel}, address = {Bratislava}, booktitle = {14th Conference on Applied Mathematics, APLIMAT 2015}, edition = {1. vyd.}, keywords = {Graph theory; Joseph Kruskal; Minimum spanning tree; Reverse algorithm}, howpublished = {paměťový nosič}, language = {eng}, location = {Bratislava}, isbn = {978-80-227-4314-3}, pages = {10-19}, publisher = {Slovak University of Technology in Bratislava}, title = {Minimum spanning tree problem}, year = {2015} }
TY - JOUR ID - 27521 AU - Antoš, Karel PY - 2015 TI - Minimum spanning tree problem PB - Slovak University of Technology in Bratislava CY - Bratislava SN - 9788022743143 KW - Graph theory KW - Joseph Kruskal KW - Minimum spanning tree KW - Reverse algorithm N2 - This article provides different approaches to certain models of graph theory, where the minimum spanning tree (MST) models are suitable. Graph theory knows a variety of methods how to solve this problem of looking for the minimum spanning tree and this article compares two of them in terms of their choice of use. The principle of the MST problem describes various kinds of situations where it is necessary to use this theoretical instrument, 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. Minimum spanning tree problem. In \textit{14th Conference on Applied Mathematics, APLIMAT 2015}. 1. vyd. Bratislava: Slovak University of Technology in Bratislava, 2015, s.~10-19. ISBN~978-80-227-4314-3.
|