Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
From MaRDI portal
Publication:5741782
DOI10.1137/1.9781611973105.74zbMath1420.68156OpenAlexW2949621970MaRDI QIDQ5741782
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973105.74
Trees (05C05) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (10)
Simultaneous visibility representations of plane \(st\)-graphs using L-shapes ⋮ Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ Minimal Obstructions for Partial Representations of Interval Graphs ⋮ A new perspective on clustered planarity as a combinatorial embedding problem ⋮ Extending partial representations of proper and unit interval graphs ⋮ The importance of being proper ⋮ Drawing Simultaneously Embedded Graphs with Few Bends ⋮ Advancements on SEFE and partitioned book embedding problems ⋮ Extending partial representations of subclasses of chordal graphs ⋮ Disconnectivity and relative positions in simultaneous embeddings
This page was built for publication: Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
