An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
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...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://scholars.utp.edu.my/id/eprint/2134/ http://scholars.utp.edu.my/id/eprint/2134/1/An_Edge-wise_Linear_Shortest_Path_Algorithm_for_Non_Negative_Weighted_Undirected_Graphs.rar |
| _version_ | 1848659206777864192 |
|---|---|
| author | Qureshi, M.A. Hassan, M.F. Safdar, S. Akbar, R. Sammi, R. |
| author_facet | Qureshi, M.A. Hassan, M.F. Safdar, S. Akbar, R. Sammi, R. |
| author_sort | Qureshi, M.A. |
| building | UTP Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-13T07:26:45Z |
| format | Conference or Workshop Item |
| id | oai:scholars.utp.edu.my:2134 |
| institution | Universiti Teknologi Petronas |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-13T07:26:45Z |
| publishDate | 2010 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | oai:scholars.utp.edu.my:21342013-10-25T02:44:45Z http://scholars.utp.edu.my/id/eprint/2134/ An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs Qureshi, M.A. Hassan, M.F. Safdar, S. Akbar, R. Sammi, R. QA75 Electronic computers. Computer science QA76 Computer software 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. 2010 Conference or Workshop Item PeerReviewed other en http://scholars.utp.edu.my/id/eprint/2134/1/An_Edge-wise_Linear_Shortest_Path_Algorithm_for_Non_Negative_Weighted_Undirected_Graphs.rar 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. |
| spellingShingle | QA75 Electronic computers. Computer science QA76 Computer software Qureshi, M.A. Hassan, M.F. Safdar, S. Akbar, R. Sammi, R. An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs |
| title | An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs |
| title_full | An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs |
| title_fullStr | An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs |
| title_full_unstemmed | An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs |
| title_short | An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs |
| title_sort | edge-wise linear shortest path algorithm for non-negative weighted undirected graphs |
| topic | QA75 Electronic computers. Computer science QA76 Computer software |
| url | http://scholars.utp.edu.my/id/eprint/2134/ http://scholars.utp.edu.my/id/eprint/2134/1/An_Edge-wise_Linear_Shortest_Path_Algorithm_for_Non_Negative_Weighted_Undirected_Graphs.rar |