Separator-Based Sparsification II: Edge and Vertex Connectivity

David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1998 SIAM journal on computing (Print)  
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe algorithms and data structures for maintaining information about 2-and 3-vertex-connectivity, and 3-and 4-edge-connectivity in a planar graph in O(n 1/2 ) amortized time per insertion, deletion, or connectivity query. All of the data structures handle insertions that keep the graph planar without regard to any
more » ... r embedding of the graph. Our algorithms are based on a new type of sparsification combined with several properties of separators in planar graphs.
doi:10.1137/s0097539794269072 fatcat:umm2mcjkbnhv3klkqjyibajese