Finding a Small Vertex Cut on Distributed Networks

Yonggang Jiang, Sagnik Mukhopadhyay

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…