Succinct greedy drawings do not always exist
From MaRDI portal
Publication:2894243
DOI10.1002/NET.21449zbMATH Open1244.05154OpenAlexW2034951516MaRDI QIDQ2894243FDOQ2894243
Authors: 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
Recommendations
Cites Work
- On a conjecture related to geometric routing
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- Succinct greedy geometric routing in the Euclidean plane
- An Algorithm to Construct Greedy Drawings of Triangulations
- Some results on greedy embeddings in metric spaces
- Greedy drawings of triangulations
- Area requirement and symmetry display of planar upward drawings
- On succinct convex greedy drawing of 3-connected plane graphs
- Transitions in geometric minimum spanning trees
- Polynomial area bounds for MST embeddings of trees
- On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
- Proximity drawings in polynomial area and volume
Cited In (8)
- On planar greedy drawings of 3-connected planar graphs
- Greedy rectilinear drawings
- Greedy rectilinear drawings
- Drawing graphs as spanners
- Succinct greedy drawings do not always exist
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Euclidean greedy drawings of trees
- On the area requirements of planar greedy drawings of triconnected planar graphs
This page was built for publication: Succinct greedy drawings do not always exist
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894243)
