We study the problem of maintaining the 2-edge-, 2-vertex-, and 3-edge-connected components of a dynamic planar graph subject to edge deletions. The 2-edge-connected components can be maintained in a total of O(nlog n) time under any sequence of at most O(n) deletions. This gives O(log n) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total of O(n log2 n) time. This gives O(log2 n) amortized time per deletion. The space required by all our data structures is O(n).
CITATION STYLE
Giammarresi, D., & Italiano, G. F. (1992). Dynamic 2- and 3-connectivity on planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 621 LNCS, pp. 221–232). Springer Verlag. https://doi.org/10.1007/3-540-55706-7_19
Mendeley helps you to discover research relevant for your work.