Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time

DOI10.1007/978-3-642-36763-2_30zbMath1377.68172OpenAlexW2151422426WikidataQ62042439 ScholiaQ62042439MaRDI QIDQ4912215

Giuseppe Liotta, Seok-Hee Hong, Pascal Schweitzer, Yusuke Suzuki, Naoki Katoh, Peter Eades

Publication date: 3 April 2013

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36763-2_30

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

An annotated bibliography on 1-planarity ⋮ Proper 1-immersions of graphs triangulating the plane ⋮ A note on 1-planar graphs ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ Right angle crossing graphs and 1-planarity ⋮ A linear-time algorithm for testing outer-1-planarity

This page was built for publication: Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time