| Sarnak: Fully Dynamic Planarity Testing with Applications (1999) | |||||||||||||||||
Abstract | |||||||||||||||||
| This paper introduces compressed certificates for planarity, biconnectivity and triconnectivity in planar graphs, and prove many structural properties of certificates in planar graphs. As an application of our compressed certificates, we develop efficient dynamic planar algorithms. In particular, we consider the following three operations on a planar graph G: (i) insert an edge if the resultant graph remains planar; (ii) delete an edge; and (iii) test whether an edge could be added to the graph without violating planarity. We show how to support each of the above operations in O(n 2=3) time, where n is the number of vertices in the graph. The bound for tests and deletions is worst-case, while the bound for insertions is amortized. This is the first algorithm for this problem with sub-linear running time, and it affirmatively answers a question posed in [Eppstein et al. 1992]. We use our compressed certificates for biconnectivity and triconnectivity to maintain the biconnected and triconnected components of a dynamic planar graph. The time bounds are the same: O(n | |||||||||||||||||
Details der Publikation | |||||||||||||||||
| |||||||||||||||||