A Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths
In this paper, we propose an efficient method for implementing Dijkstra's algorithm for the Single Source Shortest Path Problem (SSSPP) in a graph whose edges have positive length, and where there are few distinct edge lengths. The SSSPP is one of the most widely studied problems in theoretical...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Elsevier
2011
|
| Online Access: | http://hdl.handle.net/1721.1/67886 https://orcid.org/0000-0002-7488-094X |