arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.04010cs.DS
收藏

容错模型中一种有效的强连通分量算法

An efficient strongly connected components algorithm in the fault tolerant model

Surender Baswana, Keerti Choudhary, Liam Roditty

摘要:

在本文中,我们研究的问题,保持强连通组件的图中存在的故障。特别是,我们表明,给定一个有向图$G=(V,E)$与$n=|V|$和$m=|E|$,和一个整数值$k\geq 1$,有一个算法,计算在$O(2^{k}n\log^2 n)$的时间为任何一组$F$的大小最多$k$的强连接组件的图形$G\setminus F$。由于输出$G\setminus F$的SCC的时间至少为$Ω(n)$,因此我们的算法的运行时间几乎是最佳的。该算法使用在预处理阶段以多项式时间计算的数据结构,其大小为$O(2^{k} n^2)$。我们的结果是使用一个新的观察强连通分量(SCC)和可达性之间的关系。更具体地说,我们的结果中的主要构建块之一是问题的限制变体,其中我们只计算与特定路径相交的强连通分量。将我们的注意力限制在路径上允许我们隐式地计算路径顶点与图的其余部分之间的可达性,该可达性与路径的大小呈几何关系而不是线性关系。然而,仅凭这一新观察,是不够的,因为我们需要找到一种有效的方法来表示强连接组件使用路径。为此,我们使用的混合物的旧的和经典的技术,如沉重的路径分解的Sleator和Tarjan和经典的深度优先搜索算法。虽然,这些现在是标准的技术,我们不知道他们的动态维护SCC的上下文中的任何使用。因此,我们希望我们的新见解和新老技术的混合将是独立的利益。

英文摘要:

In this paper we study the problem of maintaining the strongly connected components of a graph in the presence of failures. In particular, we show that given a directed graph $G=(V,E)$ with $n=|V|$ and $m=|E|$, and an integer value $k\geq 1$, there is an algorithm that computes in $O(2^{k}n\log^2 n)$ time for any set $F$ of size at most $k$ the strongly connected components of the graph $G\setminus F$. The running time of our algorithm is almost optimal since the time for outputting the SCCs of $G\setminus F$ is at least $Ω(n)$. The algorithm uses a data structure that is computed in a preprocessing phase in polynomial time and is of size $O(2^{k} n^2)$. Our result is obtained using a new observation on the relation between strongly connected components (SCCs) and reachability. More specifically, one of the main building blocks in our result is a restricted variant of the problem in which we only compute strongly connected components that intersect a certain path. Restricting our attention to a path allows us to implicitly compute reachability between the path vertices and the rest of the graph in time that depends logarithmically rather than linearly in the size of the path. This new observation alone, however, is not enough, since we need to find an efficient way to represent the strongly connected components using paths. For this purpose we use a mixture of old and classical techniques such as the heavy path decomposition of Sleator and Tarjan and the classical Depth-First-Search algorithm. Although, these are by now standard techniques, we are not aware of any usage of them in the context of dynamic maintenance of SCCs. Therefore, we expect that our new insights and mixture of new and old techniques will be of independent interest.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑