Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity

DOI10.1137/1.9781611975994.146OpenAlexW3000876286MaRDI QIDQ5146936

Jacob Holm, Eva Rotenberg

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.09005

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ Maintaining triconnected components under node expansion ⋮ Synchronized Planarity with Applications to Constrained Planarity Problems

This page was built for publication: Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity