On the area requirements of planar greedy drawings of triconnected planar graphs
From MaRDI portal
Publication:2019489
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- Algorithmic Aspects of Wireless Sensor Networks
- An Algorithm to Construct Greedy Drawings of Triangulations
- Construction and Local Routing for Angle-Monotone Graphs
- Euclidean greedy drawings of trees
- Gabriel triangulations and angle-monotone graphs: local routing and recognition
- Greedy drawings of triangulations
- Hyperbolic Embeddings for Near-Optimal Greedy Routing
- Increasing-chord graphs on point sets
- On a conjecture related to geometric routing
- On planar greedy drawings of 3-connected planar graphs
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- On the number of planar orientations with prescribed degrees
- Self-approaching graphs
- Some results on greedy embeddings in metric spaces
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- Succinct greedy drawings do not always exist
- Succinct greedy geometric routing in the Euclidean plane
- Succinct strictly convex greedy drawing of 3-connected plane graphs
Cited in
(5)- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Greedy drawings of triangulations
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- On Area-Optimal Planar Graph Drawings
- On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs
This page was built for publication: On the area requirements of planar greedy drawings of triconnected planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019489)
