Graph Drawing
From MaRDI portal
Publication:5193167
DOI10.1007/b94919zbMath1215.05117OpenAlexW4250021921MaRDI QIDQ5193167
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94919
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete ⋮ Alternation Graphs ⋮ Succinct navigational oracles for families of intersection graphs on a circle
This page was built for publication: Graph Drawing