Maintaining triconnected components under node expansion
From MaRDI portal
Publication:6601461
DOI10.57717/CGT.V3I2.44MaRDI QIDQ6601461FDOQ6601461
Authors: Simon D. Fink, Ignaz Rutter 
Publication date: 10 September 2024
Published in: CGT. Computing in Geometry and Topology (Search for Journal in Brave)
Cites Work
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Title not available (Why is that?)
- On-Line Planarity Testing
- Dividing a Graph into Triconnected Components
- On-line maintenance of triconnected components with SPQR-trees
- Strip planarity testing for embedded planar graphs
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Simultaneous PQ-ordering with applications to constrained embedding problems
- A structural characterization of planar combinatorial graphs
- Separator based sparsification. I: Planarity testing and minimum spanning trees
- Fully-dynamic planarity testing in polylogarithmic time
- Testing mutual duality of planar graphs
- Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
- Maintaining triconnected components under node expansion
- Synchronized Planarity with Applications to Constrained Planarity Problems
- Constrained planarity in practice: engineering the synchronized planarity algorithm
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)
