An edge-wise linear shortest path algorithm for non negative weighted undirected graphs

Authors:
M. Aasim Qureshi;Mohd Fadzil Hassan;Sohail Safdar;Rehan Akbar;Rabia Sammi
Affiliations:
Universiti. Technologi, Petronas, Malaysia;Universiti. Technologi, Petronas, Malaysia;Universiti. Technologi, Petronas, Malaysia;Universiti. Technologi, Petronas, Malaysia;UIIT, PMAS Arid Agriculture University, Rawalpindi, Pakistan
Venue:
Proceedings of the 7th International Conference on Frontiers of Information Technology
Year:
2009

Citing 13
Cited 0

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Faster algorithms for the shortest path problem

Journal of the ACM (JACM)
Surpassing the information theoretic bound with fusion trees

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Recent results on the single-source shortest paths problem

ACM SIGACT News
Fusion trees can be implemented with AC0 instructions only

Theoretical Computer Science
On RAM priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Buckets, heaps, lists, and monotone priority queues

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Floats, Integers, and Single Source Shortest Paths

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Experimental Evaluation of a New Shortest Path Algorithm

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Priority Queues: Small, Monotone and Trans-dichotomous

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
On the difficulty of some shortest path problems

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

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.