Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity

Max Franck, Sorrachai Yingchareonthawornchai

Vertex connectivity is a well-studied concept in graph theory with numerous applications. A graph is $k$-connected if it remains connected after removing any $k-1$ vertices. The ve…