A Linear-Time Algorithm for Testing Outer-1-Planarity
From MaRDI portal
Publication:2867645
DOI10.1007/978-3-319-03841-4_7zbMath1406.68083OpenAlexW1648748816MaRDI QIDQ2867645
Seok-Hee Hong, Pascal Schweitzer, Naoki Katoh, Peter Eades, Yusuke Suzuki, Giuseppe Liotta
Publication date: 20 December 2013
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_7
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Outer 1-planar graphs ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Fan-planarity: properties and complexity
This page was built for publication: A Linear-Time Algorithm for Testing Outer-1-Planarity
