Dimensions
DimensionsQureshi, M.A. and Hassan, M.F. (2010) Improvements over two phase shortest path algorithm. In: UNSPECIFIED.
Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....
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. © 2010 IEEE.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | cited By 7; Conference of 2010 International Symposium on Information Technology, ITSim'10 ; Conference Date: 15 June 2010 Through 17 June 2010; Conference Code:81915 |
| Uncontrolled Keywords: | Classical problems; Complexity levels; Expected improvements; Processing Time; Shortest path; Shortest path algorithms; Shortest path problem; Theoretical computer science; Two phase, Algorithms; Computer science; Information technology, Graph theory |
| Depositing User: | Mr Ahmad Suhairi UTP |
| Date Deposited: | 09 Nov 2023 15:49 |
| Last Modified: | 09 Nov 2023 15:49 |
| URI: | https://khub.utp.edu.my/scholars/id/eprint/1078 |
Actions (login required)
- View Item