Drawing Graphs with Few Arcs

DOI10.1007/978-3-642-45043-3_35zbMath1417.05140OpenAlexW20577836MaRDI QIDQ5891331

André Schulz

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_35

Mathematics Subject Classification ID

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

Related Items (2)

Contact Graphs of Circular Arcs ⋮ Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments

This page was built for publication: Drawing Graphs with Few Arcs