Minimum spanning tree problem

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Minimum spanning tree problem

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Minimum spanning tree problem

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2015

Kód důvěrnosti údajů

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

Název statě ve sborníku

14th Conference on Applied Mathematics, APLIMAT 2015

ISBN

9788022743143

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

10-19

Název nakladatele

Slovak University of Technology in Bratislava

Místo vydání

Bratislava

Místo konání akce

Bratislava

Datum konání akce

3. 2. 2015

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—