Maintaining triconnected components under node expansion

DOI10.1007/978-3-031-30448-4_15arXiv2301.03972MaRDI QIDQ6057331

Ignaz Rutter, Simon D. Fink

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

SPQR-treedynamic algorithmcluster planarity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• On-line maintenance of triconnected components with SPQR-trees
• Separator based sparsification. I: Planarity testing and minimum spanning trees
• On-Line Planarity Testing
• Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Fully-dynamic planarity testing in polylogarithmic time
• Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
• TESTING MUTUAL DUALITY OF PLANAR GRAPHS

This page was built for publication: Maintaining triconnected components under node expansion