Separator-Based Sparsification II: Edge and Vertex Connectivity

Authors:
David Eppstein;Zvi Galil;Giuseppe F. Italiano;Thomas H. Spencer
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 5

Fully dynamic planarity testing with applications

Journal of the ACM (JACM)
Fully-dynamic min-cut

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An Experimental Study of Dynamic Algorithms for Transitive Closure

Journal of Experimental Algorithmics (JEA)
Maintaining dynamic minimum spanning trees: An experimental study

Discrete Applied Mathematics
Dynamic graph algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.01

Visualization

Abstract

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(n1/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 particular embedding of the graph. Our algorithms are based on a new type of sparsification combined with several properties of separators in planar graphs.