Testing Planarity of Partially Embedded Graphs

DOI10.1145/2629341zbMath1398.68385MaRDI QIDQ4962193

Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter, Vít Jelínek, Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati

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

zbMATH Keywords

algorithm; planarity; simultaneous embedding; partial embedding

Mathematics Subject Classification ID

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)