Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
From MaRDI portal
Publication:3073681
DOI10.1007/978-3-642-18469-7_28zbMath1314.68235OpenAlexW1521937241WikidataQ62041804 ScholiaQ62041804MaRDI QIDQ3073681
Sheung-Hung Poon, Ján Maňuch, Chris Thachuk, Murray Patterson
Publication date: 11 February 2011
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10281/217381
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
HV-planarity: algorithms and complexity ⋮ Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings ⋮ Combinatorial properties and recognition of unit square visibility graphs ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Unnamed Item
This page was built for publication: Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
