A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs
| dc.creator | Koskas, Michel | |
| dc.date | 2003-10-10 | |
| dc.date.accessioned | 2026-07-07T03:20:26Z | |
| dc.date.available | 2026-07-07T03:20:26Z | |
| dc.description | This paper details a new algorithm to solve the shortest path problem in valued graphs. Its complexity is $O(D \log v)$ where $D$ is the graph diameter and $v$ its number of vertices. This complexity has to be compared to the one of the Dijkstra's algorithm, which is $O(e\log v)$ where $e$ is the number of edges of the graph. This new algorithm lies on a hierarchical representation of the graph, using radix trees. The performances of this algorithm show a major improvement over the ones of the algorithms known up to now. | |
| dc.description | 18 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0310019 | |
| dc.identifier | http://arxiv.org/abs/cs/0310019 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31825 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.2; G.4 | |
| dc.title | A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs | |
| dc.type | text |