Improvement of shortest path algorithms through graph partitioning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00183405" target="_blank" >RIV/68407700:21240/11:00183405 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Improvement of shortest path algorithms through graph partitioning
Original language description
Route planning problem occurs often in many practical areas of life including problem of finding of optimal paths in road networks. This paper presents an algorithm based upon traditional graph algorithms, like the Dijkstra's shortest path algorithm butit takes advantage of the specific properties of a road network graph. Presented modification of algorithm partitions a given graph into smaller components, it results in efficient execution even for large-scale graphs. Searching in smaller components still guarantee optimality of solution.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
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
Proceedings of International Conference PRESENTATION of MATHEMATICS '11
ISBN
978-80-7372-773-4
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
131-137
Publisher name
Technická univerzita
Place of publication
Liberec
Event location
Liberec
Event date
Oct 20, 2011
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—