Incremental Approximate Vertex Connectivity via Almost-Linear Time Local Cut AlgorithmsResearch Paper
The vertex connectivity of a graph is the least number of vertices whose removal disconnects it. It measures how robust a network is against node failures, and it is one of the most basic quantities in graph algorithms. For directed graphs the notion is strong connectivity: is the least size of a set whose deletion leaves a graph that is…