A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Decremental SPQR-trees for Planar Graphs
2018
European Symposium on Algorithms
We present a decremental data structure for maintaining the SPQR-tree of a planar graph subject to edge contractions and deletions. The update time, amortized over Ω(n) operations, is O(log 2 n). Via SPQR-trees, we give a decremental data structure for maintaining 3-vertex connectivity in planar graphs. It answers queries in O(1) time and processes edge deletions and contractions in O(log 2 n) amortized time. The previous best supported deletions and insertions in O( √ n ) time.
doi:10.4230/lipics.esa.2018.46
dblp:conf/esa/HolmIKLR18
fatcat:styzxed7dffvzlf5lp4zem25uu