A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs

Details A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs

2003-10-10

arxiv.org/abs/cs/0310019v1

Computer Science

Data Structures and Algorithms

18 pages, 5 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216748