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...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://scholars.utp.edu.my/id/eprint/3147/ http://scholars.utp.edu.my/id/eprint/3147/1/stamp.jsp%3Ftp%3D%26arnumber%3D5561538%26tag%3D1 |
| _version_ | 1848659357711990784 |
|---|---|
| author | Qureshi, M.A. Hassan, M.F. |
| author_facet | Qureshi, M.A. Hassan, M.F. |
| author_sort | Qureshi, M.A. |
| building | UTP Institutional Repository |
| collection | Online Access |
| 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. |
| first_indexed | 2025-11-13T07:29:09Z |
| format | Conference or Workshop Item |
| id | oai:scholars.utp.edu.my:3147 |
| institution | Universiti Teknologi Petronas |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-13T07:29:09Z |
| publishDate | 2010 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | oai:scholars.utp.edu.my:31472017-01-19T08:24:14Z http://scholars.utp.edu.my/id/eprint/3147/ 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 en http://scholars.utp.edu.my/id/eprint/3147/1/stamp.jsp%3Ftp%3D%26arnumber%3D5561538%26tag%3D1 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://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=5561538&queryText%3DImprovement+Over+two%26openedRefinements%3D*%26searchField%3DSearch+All |
| spellingShingle | QA75 Electronic computers. Computer science QA76 Computer software Qureshi, M.A. Hassan, M.F. Improvements Over Two Phase Shortest Path Algorithm |
| title | 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_short | Improvements Over Two Phase Shortest Path Algorithm |
| title_sort | improvements over two phase shortest path algorithm |
| topic | QA75 Electronic computers. Computer science QA76 Computer software |
| url | http://scholars.utp.edu.my/id/eprint/3147/ http://scholars.utp.edu.my/id/eprint/3147/ http://scholars.utp.edu.my/id/eprint/3147/1/stamp.jsp%3Ftp%3D%26arnumber%3D5561538%26tag%3D1 |