BFS Tree and x-y Shortest Paths Tree
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F10%3A00002911" target="_blank" >RIV/62690094:18450/10:00002911 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
BFS Tree and x-y Shortest Paths Tree
Original language description
The Breadth-First-Search algorithm and the Depth-First-Search algorithm belong to the most used searching algorithms. The spanning trees gained by the algorithms have special and interesting properties. Using them we can obtain important statements enabling to formulate various other algorithms. In the paper the statements, based on the Breadth-First-Search, concerning circles with the given properties will be formulated at first. Then a new concept x-y Shortest Paths Tree, i.e. tree that contains all the shortest paths from the vertex x to the vertex y in the given undirected graph, will be formulated as well as an algorithm using the x-y Shortest Paths Tree to determine all the shortest paths between the two given vertices.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
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
Applied computer science : international conference
ISBN
978-960-474-225-7
ISSN
1792-4863
e-ISSN
—
Number of pages
5
Pages from-to
391-395
Publisher name
World scientific and engineering academy and society
Place of publication
Athens
Event location
Malta
Event date
Sep 15, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—