PROBLEM OF SEARCHING THE MST
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F75081431%3A_____%2F17%3A00001191" target="_blank" >RIV/75081431:_____/17:00001191 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
PROBLEM OF SEARCHING THE MST
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
16th Conference on applied mathematics, Aplimat 2017, Proceedings
ISBN
9788022746502
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
28-39
Publisher name
Vydavateľstvo Spektrum STU Bratislava
Place of publication
Bratislava
Event location
Bratislava
Event date
Jan 31, 2017
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—