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.
![[img]](http://eprints.utp.edu.my/style/images/fileicons/application_pdf.png) |
PDF
- Published Version
Restricted to Registered users only 298b |
Official URL: http://ieeexplore.ieee.org/search/srchabstract.jsp...
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software |
| Departments / MOR / COE: | Departments > Computer Information Sciences |
| ID Code: | 3147 |
| Deposited By: | Dr Mohd Fadzil Hassan |
| Deposited On: | 15 Nov 2010 04:20 |
| Last Modified: | 19 Jan 2017 08:24 |
Repository Staff Only: item control page
