Cover Image

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

Full description

Saved in:
Bibliographic Details
Main Authors: Qureshi, M.A., Hassan, M.F.
Format: Conference or Workshop Item
Published: 2010
Subjects:
QA75 Electronic computers. Computer science
QA76 Computer software
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!
id my.utp.eprints.3147
record_format eprints
spelling my.utp.eprints.31472017-01-19T08:24:14Z Improvements Over Two Phase Shortest Path Algorithm Qureshi, M.A. Hassan, M.F. QA75 Electronic computers. Computer science QA76 Computer software 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 existing algorithm prove to improve the complexity level. The need of improvement is discussed in detail and the expected improvement in overall processing time is shown with the example. 2010-06 Conference or Workshop Item PeerReviewed application/pdf 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 Qureshi, M.A. and Hassan, M.F. (2010) Improvements Over Two Phase Shortest Path Algorithm. In: International Symposium on Information Technology 2010, ITSim, June 2010, Kuala Lumpur. http://eprints.utp.edu.my/3147/
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.
Improvements Over Two Phase Shortest Path Algorithm
description 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 existing algorithm prove to improve the complexity level. The need of improvement is discussed in detail and the expected improvement in overall processing time is shown with the example.
format Conference or Workshop Item
author Qureshi, M.A.
Hassan, M.F.
author_facet Qureshi, M.A.
Hassan, M.F.
author_sort Qureshi, M.A.
title Improvements Over Two Phase Shortest Path Algorithm
title_short Improvements Over Two Phase Shortest Path Algorithm
title_full Improvements Over Two Phase Shortest Path Algorithm
title_fullStr Improvements Over Two Phase Shortest Path Algorithm
title_full_unstemmed Improvements Over Two Phase Shortest Path Algorithm
title_sort improvements over two phase shortest path algorithm
publishDate 2010
url 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/
_version_ 1738655247430057984
score 13.15806

Similar Items