A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Using this, we obtain deterministic data structures for incremental planarity testing, incremental planar embedding, and incremental triconnectivity, that each have worst case O(log^3 n) update and query ... Our proof is based on BC trees and SPQR trees, and we develop pre-split variants of these for general graphs, based on a novel biased heavy-path decomposition, where the structural changes corresponding ... As a consequence, we obtain an algorithm for incremental planarity testing of a biconnected graph with worst-case polylog update time (see Section 7.5). ...arXiv:1910.09005v1 fatcat:x6l7vkgujjhsrbg5hoagswp564