Testing Planarity of Partially Embedded Graphs
From MaRDI portal
Publication:4962193
DOI10.1145/2629341zbMath1398.68385OpenAlexW2622290498MaRDI QIDQ4962193
Patrizio Angelini, Jan Kratochvíl, Maurizio Patrignani, Fabrizio Frati, Giuseppe Di Battista, Vít Jelínek, Ignaz Rutter
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2629341
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (29)
The Complexity of Drawing a Graph in a Polygonal Region ⋮ Advances on Testing C-Planarity of Embedded Flat Clustered Graphs ⋮ One-bend drawings of outerplanar graphs inside simple polygons ⋮ Extending Partial Orthogonal Drawings ⋮ Extending partial representations of interval graphs ⋮ Extending partial representations of circular-arc graphs ⋮ Partial and simultaneous transitive orientations via modular decompositions ⋮ An annotated review on graph drawing and its applications ⋮ Planarizing graphs and their drawings by vertex splitting ⋮ Unnamed Item ⋮ Extending simple drawings ⋮ The QuaSEFE problem ⋮ An SPQR-tree-like embedding representation for upward planarity ⋮ Unnamed Item ⋮ The complexity of drawing a graph in a polygonal region ⋮ Minimal obstructions for partial representations of interval graphs ⋮ Extending upward planar graph drawings ⋮ Unnamed Item ⋮ Hierarchical partial planarity ⋮ Simultaneous FPQ-ordering and hybrid planarity testing ⋮ Unnamed Item ⋮ Inserting one edge into a simple drawing is hard ⋮ Approximation Algorithms for Facial Cycles in Planar Embeddings ⋮ Multilevel Planarity ⋮ Beyond Clustered Planar Graphs ⋮ Simultaneous Embedding ⋮ Advancements on SEFE and partitioned book embedding problems ⋮ Extending Partial Orthogonal Drawings ⋮ Free edge lengths in plane graphs
This page was built for publication: Testing Planarity of Partially Embedded Graphs
