collaborators

1 paper

cs.DS2024

Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time

Kevin Hua, Daniel Li, Jaewoo Park +1

We show the first near-linear time randomized algorithms for listing all minimum vertex cuts of polylogarithmic size that separate the graph into at least three connected component…