Improvements Over Two Phase Shortest Path Algorithm
Shortest path is an old classical problem in the area of theoretical computer science. This work is the continuation of the work done previously by the authors and presents two possible improvements in the existing algorithm. The introduced improvements which are simple and fit in easily into the ex...
Saved in:
Main Authors: | Qureshi, M.A., Hassan, M.F. |
---|---|
Format: | Conference or Workshop Item |
Published: |
2010
|
Subjects: | |
Online Access: | http://eprints.utp.edu.my/3147/1/stamp.jsp%3Ftp%3D%26arnumber%3D5561538%26tag%3D1 http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=5561538&queryText%3DImprovement+Over+two%26openedRefinements%3D*%26searchField%3DSearch+All http://eprints.utp.edu.my/3147/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Two Phase Shortest Path Algorithm for Non-Negative Undirected Graphs
by: Qureshi, MA., et al.
Published: (2010) -
A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
by: Qureshi, M.A., et al.
Published: (2010) -
An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
by: Qureshi, M.A., et al.
Published: (2010) -
Fixed channel allocation schemes based on the Floyd's shortest path algorithm
by: Goh, Kelvin Tee Hiong
Published: (2001) -
A genetic algorithm solution to the shortest path problem in OSPF and MPLS / by Tee Wee Jing.
by: Tee Wee Jing, Wee Jing
Published: (2002)