On the area requirements of planar greedy drawings of triconnected planar graphs
type: Item
instance of: scholarly article
title: On the area requirements of planar greedy drawings of triconnected planar graphs
DOI: 10.1007/978-3-030-58150-3_35
author: Giordano Da Lozzo
author: Anthony D'Angelo
author: Fabrizio Frati
publication date: 2021-04-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/2003.00556
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7336124
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3081569775
cites work: Self-approaching Graphs
cites work: Succinct greedy drawings do not always exist
cites work: An Algorithm to Construct Greedy Drawings of Triangulations
cites work: Hyperbolic Embeddings for Near-Optimal Greedy Routing
cites work: Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
cites work: On planar greedy drawings of 3-connected planar graphs
cites work: Increasing-Chord Graphs On Point Sets
cites work: Greedy drawings of triangulations
cites work: Succinct Greedy Geometric Routing Using Hyperbolic Geometry
cites work: On the number of planar orientations with prescribed degrees
cites work: Succinct Greedy Geometric Routing in the Euclidean Plane
cites work: On succinct greedy drawings of plane triangulations and 3-connected plane graphs
cites work: Some results on greedy embeddings in metric spaces
cites work: Construction and Local Routing for Angle-Monotone Graphs
cites work: On self-approaching and increasing-chord drawings of 3-connected planar graphs
cites work: Euclidean greedy drawings of trees
cites work: On a conjecture related to geometric routing
cites work: Algorithmic Aspects of Wireless Sensor Networks
cites work: Q3138887
cites work: Succinct strictly convex greedy drawing of 3-connected plane graphs
description: scientific article; zbMATH DE number 7336124