Cover Image

A O(|E|) Time 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...

Full description

Saved in:
Bibliographic Details
Main Authors: Qureshi, M.A., Hassan, M.F., Safdar, S., Akhbar, R.
Format: Article
Published: 2010
Subjects:
QA75 Electronic computers. Computer science
QA76 Computer software
Online Access:http://eprints.utp.edu.my/2122/1/IJCIS_2009_2.rar
http://eprints.utp.edu.my/2122/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utp.eprints.2122
record_format eprints
spelling my.utp.eprints.21222013-10-25T02:45:05Z A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs Qureshi, M.A. Hassan, M.F. Safdar, S. Akhbar, 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 algorithms for calculating shortest path for (i) nonnegative weighted undirected graphs (ii) unweighted undirected graphs. The algorithm completes its execution in O(|E|) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node. 2010 Article PeerReviewed other http://eprints.utp.edu.my/2122/1/IJCIS_2009_2.rar Qureshi, M.A. and Hassan, M.F. and Safdar, S. and Akhbar, R. (2010) A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs. International Journal on Computer Science and Information Security (IJSIS), Volume 6 (No 1). pp. 40-46. ISSN 1947-5500 http://eprints.utp.edu.my/2122/
institution Universiti Teknologi Petronas
building UTP Resource Centre
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Petronas
content_source UTP Institutional Repository
url_provider http://eprints.utp.edu.my/
topic QA75 Electronic computers. Computer science
QA76 Computer software
spellingShingle QA75 Electronic computers. Computer science
QA76 Computer software
Qureshi, M.A.
Hassan, M.F.
Safdar, S.
Akhbar, R.
A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
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 algorithms for calculating shortest path for (i) nonnegative weighted undirected graphs (ii) unweighted undirected graphs. The algorithm completes its execution in O(|E|) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node.
format Article
author Qureshi, M.A.
Hassan, M.F.
Safdar, S.
Akhbar, R.
author_facet Qureshi, M.A.
Hassan, M.F.
Safdar, S.
Akhbar, R.
author_sort Qureshi, M.A.
title A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
title_short A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
title_full A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
title_fullStr A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
title_full_unstemmed A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
title_sort o(|e|) time shortest path algorithm for non-negative weighted undirected graphs
publishDate 2010
url http://eprints.utp.edu.my/2122/1/IJCIS_2009_2.rar
http://eprints.utp.edu.my/2122/
_version_ 1738655171161882624
score 13.244745

Similar Items