We present an algorithm for distributed networks to efficiently find a small vertex cut in the CONGEST model. Given a positive integer $\kappa$, our algorithm can, with high probability, either find $\kappa$ vertices whose removal disconnects the network or return that such $\kappa$ vertices do not exist. Our algorithm takes $\kappa^3\cdot \tilde{O}(D+\sqrt{n})$ rounds, where $n$ is the number of vertices in the network and $D$ denotes the network's diameter. This implies $\tilde{O}(D+\sqrt{n})$ round complexity whenever $\kappa=\text{polylog}(n)$. Prior to our result, a bound of $\tilde{O}(D)$ is known only when $\kappa=1,2$ [Parter, Petruschka DISC'22]. For $\kappa\geq 3$, this bound can be obtained only by an $O(\log n)$-approximation algorithm [Censor-Hillel, Ghaffari, Kuhn PODC'14], and the only known exact algorithm takes $O\left((\kappa\Delta D)^{O(\kappa)}\right)$ rounds, where $\Delta$ is the maximum degree [Parter DISC'19]. Our result answers an open problem by Nanongkai, Saranurak, and Yingchareonthawornchai [STOC'19].
翻译:我们提出了一种在CONGEST模型下分布式网络高效寻找小顶点割的算法。给定正整数$\kappa$,我们的算法能够以高概率找出$\kappa$个使网络断连的顶点,或判定不存在这样的$\kappa$个顶点。该算法需要$\kappa^3\cdot \tilde{O}(D+\sqrt{n})$轮复杂度,其中$n$为网络顶点数,$D$表示网络直径。当$\kappa=\text{polylog}(n)$时,这意味着$\tilde{O}(D+\sqrt{n})$的轮复杂度。在此之前,仅当$\kappa=1,2$时已知$\tilde{O}(D)$的复杂度上界[Parter, Petruschka DISC'22]。对于$\kappa\geq 3$,该上界仅能通过$O(\log n)$近似比算法获得[Censor-Hillel, Ghaffari, Kuhn PODC'14],而唯一已知的精确算法需要$O\left((\kappa\Delta D)^{O(\kappa)}\right)$轮($\Delta$为最大度)[Parter DISC'19]。我们的结果回答了Nanongkai、Saranurak与Yingchareonthawornchai [STOC'19]提出的开放问题。