An efficient algorithm for the Single-Source Shortest Path Problem in graph theory

The single-source shortest path problem (SSSP), known as the basis of many application areas, is a fundamental matter in graph theory. In this paper, a new efficient algorithm named Li-Qi (LQ) is proposed for SSSP to find a simple path of minimum total weights from a designated source vertex to each...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings 2008 3rd international conference on intelligent system and knowledge engineering : Nov. 17-19, 2008, Xiamen, China Ročník 1; s. 152 - 157
Hlavní autori: Tianrui Li, Luole Qi, Da Ruan
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.11.2008
Predmet:
Algorithm design and analysis
Application software
Computer science
Graph theory
Information science
Intelligent systems
Knowledge engineering
Routing
Shortest path problem
Transportation
ISBN:9781424421961, 1424421969
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The single-source shortest path problem (SSSP), known as the basis of many application areas, is a fundamental matter in graph theory. In this paper, a new efficient algorithm named Li-Qi (LQ) is proposed for SSSP to find a simple path of minimum total weights from a designated source vertex to each vertex. The algorithm is based on the ideas of the queue and the relaxation, The main differences between this strategy with the Breadth-first search and the Bellman-Ford algorithm are that the vertices may be queued more than once and only the source vertex and relaxed vertices are queued; the algorithm terminates when the queue is empty. Experimental evaluation on different sizes of the generated graphs validates that the proposed algorithm far outperforms the simplest implementation of the Dijkstra¿s algorithm and surpasses the Bellman-Ford algorithm by about 2 times.
ISBN:9781424421961
1424421969
DOI:10.1109/ISKE.2008.4730916