Constrained planarity in practice -- engineering the synchronized planarity algorithm

DOI10.7155/JGAA.V29I1.2923MaRDI QIDQ7232109zbMATH OpenFDO

Authors Simon D. Fink, Ignaz Rutter

Publication date 22 April 2026

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/JGAA.V29I1.2923

zbMATH Keywords

clustered planarityconstrained planarityexperimental evaluation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A new approach to the maximum-flow problem
• Advancements on SEFE and partitioned book embedding problems
• C-Planarity of C-Connected Clustered Graphs
• Clustered planarity testing revisited
• Clustered planarity with pipes
• Completely connected clustered graphs
• Computing Maximum C-Planar Subgraphs
• Disconnectivity and relative positions in simultaneous embeddings
• Experimental comparison of PC-trees and PQ-trees
• Graph Drawing
• Graph drawing. 15th international symposium, GD 2007, Sydney, Australia, September 24--26, 2007. Revised papers
• Graph Layout Aesthetics in UML Diagrams: User Preferences
• Hanani-Tutte, monotone drawings, and level-planarity
• Handbook of graph drawing and visualization
• Hierarchical planarity testing algorithms
• scientific article; zbMATH DE number 1189242 (Why is no real title available?)
• scientific article; zbMATH DE number 1974122 (Why is no real title available?)
• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• scientific article; zbMATH DE number 1377359 (Why is no real title available?)
• scientific article; zbMATH DE number 2084781 (Why is no real title available?)
• Implementing a partitioned 2-page book embedding testing algorithm
• Maintaining triconnected components under node expansion
• On simultaneous planar graph embeddings
• On-line maintenance of triconnected components with SPQR-trees
• Planarity for clustered graphs
• Practical Experience with Hanani-Tutte for Testing c-Planarity
• Practical Level Planarity Testing and Layout with Embedding Constraints
• Shrinking the search space for clustered planarity
• Simultaneous Embedding
• Simultaneous Graph Embeddings with Fixed Edges
• Simultaneous PQ-ordering with applications to constrained embedding problems
• Synchronized Planarity with Applications to Constrained Planarity Problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Testing Planarity of Partially Embedded Graphs
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• Toward a theory of planarity: Hanani-Tutte and planarity variants
• TRÉMAUX TREES AND PLANARITY

This page was built for publication: Constrained planarity in practice -- engineering the synchronized planarity algorithm

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