On the area requirements of planar greedy drawings of triconnected planar graphs
From MaRDI portal
Publication:2019489
DOI10.1007/978-3-030-58150-3_35OpenAlexW3081569775MaRDI QIDQ2019489
Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati
Publication date: 21 April 2021
Full work available at URL: https://arxiv.org/abs/2003.00556
Cites Work
- Unnamed Item
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Some results on greedy embeddings in metric spaces
- Greedy drawings of triangulations
- On the number of planar orientations with prescribed degrees
- On planar greedy drawings of 3-connected planar graphs
- Euclidean greedy drawings of trees
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- On a conjecture related to geometric routing
- Succinct greedy drawings do not always exist
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- Succinct Greedy Geometric Routing in the Euclidean Plane
- Self-approaching Graphs
- Hyperbolic Embeddings for Near-Optimal Greedy Routing
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- Algorithmic Aspects of Wireless Sensor Networks
- Construction and Local Routing for Angle-Monotone Graphs
- An Algorithm to Construct Greedy Drawings of Triangulations
- Increasing-Chord Graphs On Point Sets
This page was built for publication: On the area requirements of planar greedy drawings of triconnected planar graphs
