Testing Planarity of Partially Embedded Graphs
From MaRDI portal
Publication:4962193
DOI10.1145/2629341zbMath1398.68385MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs, Hierarchical partial planarity, Minimal obstructions for partial representations of interval graphs, The complexity of drawing a graph in a polygonal region, Advancements on SEFE and partitioned book embedding problems, Free edge lengths in plane graphs, Extending partial representations of interval graphs