This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. This decomposition is an extension of the technique of strongly connected component (sc-component) decomposition. The second part presents a new method for measuring acyclicity based on modifications to two existing methods. In the new method, we decompose the graph into a 1-dominator set, which is a set of acyclic subgraphs where each subgraph is dominated by one trigger vertex. Meanwhile we compute sc-components of a degenerated graph derived from triggers. Using this preprocessing, a new SSSP algorithm has O(m + rlogl) time complexity, where r is the size of the 1-dominator set, and l is the size of the largest sc-component. In the third part, we modify the concept of a 1-dominator set to that of a 1-2-dominator set. Each of acyclic subgraphs obtained by the 1-2-dominator decomposition are dominated by one or two trigger vertices cooperatively. Such subgraphs are potentially larger than those decomposed by the 1-dominator set. Thus fewer trigger vertices are needed to cover the graph.
本文提出了在几乎无环向图计算单源最短路径(SSSPs)新的算法。第一部分介绍高阶分解 I>。这种分解是强连通分量(SC-成分)分解的技术的扩展。第二部分介绍用于测量基于修改两个现有方法acyclicity的新方法。在新的方法中,我们将分解成图1-支配集,这是一组,其中每个子图由一个触发顶点主导非循环子图。同时,我们计算从触发器导出的退化图的SC-组件。使用该预处理,一个新的SSSP算法具有O(米 I> + - [R I>日志 1 I>)时间复杂度,其中 - [R I>是1-支配集的大小,和 1 I>是最大的SC-分量的大小。在第三部分中,我们修改1-支配集的概念到1-2-支配组。由1-2支配分解获得无环子图中的每一个由一个或两个触发顶点协同控制。这样的子图是可能比那些由1-支配集分解大。因此需要更少的触发器的顶点,以覆盖图。 P>
机译:几乎非循环有向图的最短路径算法
机译:有向无环图中最短路径的蚁群优化算法的运行时间分析
机译:改进的适用于近非循环图的最短路径算法
机译:改进的适用于近非循环有向图的最短路径算法
机译:使用DECS算法搜索Markov等效有向无环图。
机译:利用精简图进行地理信息系统最短路径搜索的算法
机译:几乎非循环有向图的最短路径算法