Abstract
Classical Bellman-Ford algorithm is improved to solve the shortest path problem with bounded edge number efficiently. Using the experience of partitioning algorithm for reference, two improved algorithms are obtained, which can decrease the number of distance labels of vertices. Since all existing improved Bellman-Ford algorithms can't solve the shortest path problem with bounded edge number, these two improved algorithms are entirely new. In contrast to the common version of Bellman-Ford algorithm, these two improved algorithms can save storage space efficiently, and can raise computing efficiency remarkably.
| Original language | English |
|---|---|
| Pages (from-to) | 74-77 |
| Number of pages | 4 |
| Journal | Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology |
| Volume | 44 |
| Issue number | 7 |
| State | Published - Jul 2012 |
| Externally published | Yes |
Keywords
- Algorithm
- Bellman-Ford algorithm
- Partitioning algorithm
- The shortest path problem
Fingerprint
Dive into the research topics of 'Improvement and experimental evaluation on classical Bellman-Ford algorithm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver