Graph Drawing

DOI10.1007/b94919zbMath1215.05039OpenAlexW4250021921MaRDI QIDQ5896901

Sergio Cabello, Erik D. Demaine, Günter Rote

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

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

On the Computational Complexity of Degenerate Unit Distance Representations of Graphs

This page was built for publication: Graph Drawing