ANTOŠ, Karel. PROBLEM OF SEARCHING THE MST. In Szarková, Letavaj, Richtáriková, Prašílová. 16th Conference on applied mathematics, Aplimat 2017, Proceedings. first. Bratislava: Vydavateľstvo Spektrum STU Bratislava, 2017. s. 28-39. ISBN 978-80-227-4650-2. |
Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{42661, author = {Antoš, Karel}, address = {Bratislava}, booktitle = {16th Conference on applied mathematics, Aplimat 2017, Proceedings}, edition = {first}, editor = {Szarková, Letavaj, Richtáriková, Prašílová}, keywords = {graph theory; minimum spanning tree; weighted adjacency matrix; Prim´s algorithm}, howpublished = {elektronická verze "online"}, language = {eng}, location = {Bratislava}, isbn = {978-80-227-4650-2}, pages = {28-39}, publisher = {Vydavateľstvo Spektrum STU Bratislava}, title = {PROBLEM OF SEARCHING THE MST}, year = {2017} }
TY - JOUR ID - 42661 AU - Antoš, Karel PY - 2017 TI - PROBLEM OF SEARCHING THE MST PB - Vydavateľstvo Spektrum STU Bratislava CY - Bratislava SN - 9788022746502 KW - graph theory KW - minimum spanning tree KW - weighted adjacency matrix KW - Prim´s algorithm N2 - This article describes searching for The Minimum Spanning Tree of the graph using the Weighted Adjacency Matrix. It describes the Weighted Adjacency Matrix as a new element, and shows how it could be used for searching for the Minimum Spanning Tree of the graph. This creates a new procedure for searching for the Minimum Spanning Tree of the graph which completes previously known algorithms of searching for the Minimum Spannig Tree. The proposed Weighted Adjacency Matrix could be used in similar issues in the field of the graph theory, where graphs with weighted edges are given. The procedure is shown on the attached example. ER -
ANTOŠ, Karel. PROBLEM OF SEARCHING THE MST. In Szarková, Letavaj, Richtáriková, Prašílová. \textit{16th Conference on applied mathematics, Aplimat 2017, Proceedings}. first. Bratislava: Vydavateľstvo Spektrum STU Bratislava, 2017. s.~28-39. ISBN~978-80-227-4650-2.
|