By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tianrui Li ; School of Information Science and Technology, Southwest Jiaotong University, Chengdu, 610031, China ; Luole Qi ; Da Ruan

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.

Published in:

Intelligent System and Knowledge Engineering, 2008. ISKE 2008. 3rd International Conference on  (Volume:1 )

Date of Conference:

17-19 Nov. 2008