Logo

An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs

Qureshi, M.A. and Hassan, M.F. and Safdar, S. and Akbar, R. and Sammi, R. (2010) An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs. In: International Conference on Frontiers of Information Technology, 16th – 18th December 2009, Abbottabad, Pakistan.

[img] Other (WinRAR) - Published Version
Restricted to Registered users only

231Kb

Abstract

In most of the shortest path problems like vehicle routing problems and network routing problems, we only need an efficient path between two points—source and destination, and it is not necessary to calculate the shortest path from source to all other nodes. This paper concentrates on this very idea and presents an algorithm for calculating shortest path for nonnegative weighted undirected graphs. The algorithm completes its execution in O(|E|) for all targeted graphs—where no successor node updates predecessor node. The main advantage of the algorithms is its simplicity and it does not need complex data structures for implementations.

Item Type:Conference or Workshop Item (Paper)
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Departments / MOR / COE:Departments > Computer Information Sciences
ID Code:2134
Deposited By: Dr Mohd Fadzil Hassan
Deposited On:12 May 2010 00:55
Last Modified:25 Oct 2013 02:44

Repository Staff Only: item control page

Document Downloads

More statistics for this item...