Minimum spanning tree problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F75081431%3A_____%2F15%3A00000478" target="_blank" >RIV/75081431:_____/15:00000478 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Minimum spanning tree problem
Original language description
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 thisarticle 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.
Czech name
—
Czech description
—

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
14th Conference on Applied Mathematics, APLIMAT 2015
ISBN
9788022743143
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
10-19
Publisher name
Slovak University of Technology in Bratislava
Place of publication
Bratislava
Event location
Bratislava
Event date
Feb 3, 2015
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)