Maintaining triconnected components under node expansion

DOI10.57717/CGT.V3I2.44MaRDI QIDQ6601461zbMATH OpenFDO

Authors Simon D. Fink, Ignaz Rutter

Publication date 10 September 2024

Published in CGT. Computing in Geometry and Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

SPQR-treedynamic algorithmclustered planarity

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• A structural characterization of planar combinatorial graphs
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Constrained planarity in practice: engineering the synchronized planarity algorithm
• Dividing a Graph into Triconnected Components
• Fully-dynamic planarity testing in polylogarithmic time
• Maintaining triconnected components under node expansion
• On-Line Planarity Testing
• On-line maintenance of triconnected components with SPQR-trees
• Separator based sparsification. I: Planarity testing and minimum spanning trees
• Simultaneous PQ-ordering with applications to constrained embedding problems
• Strip planarity testing for embedded planar graphs
• Synchronized Planarity with Applications to Constrained Planarity Problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Testing mutual duality of planar graphs
• Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601461)