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

DOI10.1007/978-3-319-27261-0_10MaRDI QIDQ2959747zbMATH OpenOpenAlexFDO

Authors Alexander Igamberdiev, Wouter Meulemans, 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

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

Recommendations

• Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
• Minimum-segment convex drawings of 3-connected cubic plane graphs (extended abstract)
• Minimum-segment convex drawings of 3-connected cubic plane graphs
• scientific article; zbMATH DE number 2188498
• Strictly-convex drawings of 3-connected planar graphs
• On planar greedy drawings of 3-connected planar graphs
• On planar greedy drawings of 3-connected planar graphs
• On succinct greedy drawings of plane triangulations and 3-connected plane graphs
• A note on 3-connected cubic planar graphs
• Graph Drawing

Cited in

(12)

• Drawing plane triangulations with few segments
• Intersections and circuits in sets of line segments
• Minimum-segment convex drawings of 3-connected cubic plane graphs
• On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
• On self-approaching and increasing-chord drawings of 3-connected planar graphs
• Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
• scientific article; zbMATH DE number 5005324 (Why is no real title available?)
• Minimum-segment convex drawings of 3-connected cubic plane graphs (extended abstract)
• Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs
• Drawing planar graphs with few geometric primitives
• On succinct greedy drawings of plane triangulations and 3-connected plane graphs
• scientific article; zbMATH DE number 2188498 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959747)