On the edge-length ratio of planar graphs
From MaRDI portal
Publication:2206847
DOI10.1007/978-3-030-35802-0_13OpenAlexW2990507448MaRDI QIDQ2206847
Fabrizio Frati, Manuel Borrazzo
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.03586
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to draw a planar graph on a grid
- On the edge-length ratio of outerplanar graphs
- Fixed edge-length graph drawing is NP-hard
- A near-linear area bound for drawing binary trees
- Generation of simple quadrangulations of the sphere
- Minimum-Area Drawings of Plane 3-Trees
- Planar Embeddings of Graphs with Specified Edge Lengths
This page was built for publication: On the edge-length ratio of planar graphs