00000cab a22000003a 4500 UP-99796217608727517 Buklod 20231007234724.0 m |o d | ta 090226s xx d | ||r ||||| || (iLib)UPD-00077096429 DENGII eng Galil, Zvi Fully dynamic planarity testing with applications. pp. 28-91 This paper introduces compressed certificates for planarity, biconnectivity and triconnectivity in planar graphs, and proves 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(n2/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 Epstein 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(n2/3) worst-case time per edge deletion, O(n2/3) amortized time per edge insertion, and O(n2/3) amortized time per edge insertion, and O(n2/3)worst-case time to check whether two vertices are either biconnected or triconnected. Theory of computation. Analysis of algorithms and problem complexity. Mathematics of computing. Discrete mathematics. Algorithms. Journal of the ACM 46, 1 (1999). FO UPD DENG-II Article