Succinct greedy drawings do not always exist

DOI10.1002/net.21449zbMath1244.05154OpenAlexW2034951516MaRDI QIDQ2894243

Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati

Publication date: 29 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21449

zbMATH Keywords

graph drawingexponential areagreedy drawingproximity drawings

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Euclidean greedy drawings of trees ⋮ On succinct greedy drawings of plane triangulations and 3-connected plane graphs ⋮ On the area requirements of planar greedy drawings of triconnected planar graphs ⋮ Greedy rectilinear drawings ⋮ On planar greedy drawings of 3-connected planar graphs ⋮ Greedy rectilinear drawings ⋮ Drawing graphs as spanners

Cites Work

• Unnamed Item
• Some results on greedy embeddings in metric spaces
• Polynomial area bounds for MST embeddings of trees
• Greedy drawings of triangulations
• Area requirement and symmetry display of planar upward drawings
• Transitions in geometric minimum spanning trees
• Proximity drawings in polynomial area and volume
• On a conjecture related to geometric routing
• On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• Succinct Greedy Geometric Routing in the Euclidean Plane
• An Algorithm to Construct Greedy Drawings of Triangulations

This page was built for publication: Succinct greedy drawings do not always exist