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

有向图有根连通度的快速算法

Faster Algorithms for Rooted Connectivity in Directed Graphs

Chandra Chekuri, Kent Quanrud

摘要:

我们考虑的基本问题,确定有根和全球的边缘和顶点连通性(和计算相应的削减)在有向图。对于根(因此也是全球)边连接与小整数容量,我们给出了一个新的随机蒙特卡罗算法,运行在时间$\tilde{O}(n^2)$。对于有根边连接,这是第一个算法,以改善$Ω(n^3)$的时间限制在密集图的高连通性制度。我们的结果依赖于一个简单的组合,再加上稀疏化,似乎新的采样,并可能导致进一步的权衡有向图的连通性问题。我们将边连通性的思想推广到有向图的根连通性和全局顶点连通性。我们得到一个$(1 + ε)$近似的根顶点连接$\tilde{O}(nW/ε)$时间$W$是总顶点权重(假设积分顶点权重),特别是这产生了一个$\tilde{O}(n^2/ε)$时间随机算法的未加权图。这转换为$\tilde{O}(κnW)$时间精确算法,其中$κ$是根连接。我们建立在此基础上,以获得类似的全球顶点连通性的界限。我们的结果补充了已知的结果,这些问题在低连通性制度,由于工作的Gabow [9]从1991年的边缘连接,和最近的工作Nanongkai等。[24]和福斯特等。[7]顶点连接。

英文摘要:

We consider the fundamental problems of determining the rooted and global edge and vertex connectivities (and computing the corresponding cuts) in directed graphs. For rooted (and hence also global) edge connectivity with small integer capacities we give a new randomized Monte Carlo algorithm that runs in time $\tilde{O}(n^2)$. For rooted edge connectivity this is the first algorithm to improve on the $Ω(n^3)$ time bound in the dense-graph high-connectivity regime. Our result relies on a simple combination of sampling coupled with sparsification that appears new, and could lead to further tradeoffs for directed graph connectivity problems. We extend the edge connectivity ideas to rooted and global vertex connectivity in directed graphs. We obtain a $(1 + ε)$-approximation for rooted vertex connectivity in $\tilde{O}(nW/ε)$ time where $W$ is the total vertex weight (assuming integral vertex weights); in particular this yields an $\tilde{O}(n^2/ε)$ time randomized algorithm for unweighted graphs. This translates to a $\tilde{O}(κnW)$ time exact algorithm where $κ$ is the rooted connectivity. We build on this to obtain similar bounds for global vertex connectivity. Our results complement the known results for these problems in the low connectivity regime due to work of Gabow [9] for edge connectivity from 1991, and the very recent work of Nanongkai et al. [24] and Forster et al. [7] for vertex connectivity.

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

↑