An Efficient Algorithm for All-Pairs Shortest Paths Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F02%3APU31529" target="_blank" >RIV/00216305:26210/02:PU31529 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
An Efficient Algorithm for All-Pairs Shortest Paths Problem
Original language description
The All-Pairs Shortest Paths Problem that finds shortest paths between all pairs of vertices in a connected weighted graph is usually solved by the Floyd-Warshall algorithm based on dynamic programming approach. In this paper, we propose a 'Repeated' Dijkstra algorithm based on a binary heap data structure and show that, for graphs with nonnegative weights, it has lower time complexity than the classical Floyd-Warshall algorithm
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
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 the XXIVst International Autumn Colloquium Advanced Simulation of Systems ASIS 2002
ISBN
80-85988-77-1
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
121-126
Publisher name
MARQ
Place of publication
Ostrava
Event location
Krnov
Event date
Sep 9, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—