Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments

DOI10.1007/978-3-319-27261-0_10zbMath1471.68197OpenAlexW2293626954MaRDI QIDQ2959747

Wouter Meulemans, Alexander Igamberdiev, André Schulz

Publication date: 10 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27261-0_10

Mathematics Subject Classification ID

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 (3)

Drawing plane triangulations with few segments ⋮ Drawing Planar Graphs with Few Geometric Primitives ⋮ Intersections and circuits in sets of line segments

This page was built for publication: Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments