Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 241-252, 2019.
graph algorithms local flow algorithms vertex connectivity
Vertex connectivity a classic extensively-studied problem. Given an integer k, its goal is to decide if an n-node m-edge graph can be disconnected by removing k vertices. Although a linear-time algorithm was postulated since 1974 [Aho, Hopcroft and Ullman], and despite its sibling problem of edge connectivity being resolved over two decad...More
PPT (Upload PPT)