@inproceedings{5f746b3112ee42f4a76fa85bee20a7ee,

title = "An edge-wise linear shortest path algorithm for non negative weighted undirected graphs",

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.",

keywords = "algorithms, shortest path, theoretical computer science",

author = "{Aasim Qureshi}, M. and Hassan, {Mohd Fadzil} and Sohail Safdar and Rehan Akbar and Rabia Sammi",

year = "2009",

month = dec,

day = "16",

doi = "10.1145/1838002.1838079",

language = "English",

isbn = "9781605586427",

series = "FIT '09: Proceedings of the 7th International Conference on Frontiers of Information Technology",

publisher = "Association for Computing Machinery, Inc",

booktitle = "FIT '09: Proceedings of the 7th International Conference on Frontiers of Information Technology",

note = "FIT '09: 7th International Conference on Frontiers of Information Technology ; Conference date: 16-12-2009 Through 18-12-2009",

}