求解赋值图最短路问题的分层算法
A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs
摘要:
本文详细介绍了一种解决有值图中最短路径问题的新算法。它的复杂度是$O(D \log v)$,其中$D$是图的直径,$v$是图的顶点数。这种复杂性必须与Dijkstra算法的复杂性进行比较,Dijkstra算法是$O(e\log v)$,其中$e$是图的边数。这种新算法基于图的层次表示,使用基数树。该算法的性能表现出一个重大的改进,到目前为止已知的算法。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。