On planar greedy drawings of 3-connected planar graphs
From MaRDI portal
Publication:2283114
DOI10.1007/s00454-018-0001-5zbMath1494.68191arXiv1612.09277OpenAlexW2566851301MaRDI QIDQ2283114
Giordano Da Lozzo, Fabrizio Frati, Anthony D'Angelo
Publication date: 30 December 2019
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.09277
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
On polyhedral graphs and their complements, On the area requirements of planar greedy drawings of triconnected planar graphs, Navigating planar topologies in near-optimal space and time
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
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- Long cycles in 3-connected graphs
- A novel scheme for supporting integrated unicast and multicast traffic in ad hoc wireless networks
- 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
- On Monotone Drawings of Trees
- Drawing Planar Graphs with Many Collinear Vertices
- 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
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- Algorithmic Aspects of Wireless Sensor Networks
- Trees in Polyhedral Graphs
- Monotone Drawings of Graphs
- An Algorithm to Construct Greedy Drawings of Triangulations
- Increasing-Chord Graphs On Point Sets
- An Algorithm to Construct Greedy Drawings of Triangulations
- Routing with guaranteed delivery in ad hoc wireless networks
