Homotopy height, grid-major height and graph-drawing height
From MaRDI portal
Publication:2206879
DOI10.1007/978-3-030-35802-0_36OpenAlexW2991556759MaRDI QIDQ2206879
Erin Wolf Chambers, David Eppstein, Tim Ophelders, Arnaud de Mesmay, Therese C. Biedl
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.05706
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
- On the complexity of embedding planar graphs to minimize certain distance measures
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- How to draw a planar graph on a grid
- On the parameterized complexity of layered graph drawing
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- On the pathwidth of chordal graphs
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Height-Preserving Transformations of Planar Graph Drawings
- Towards an implementation of the 3D visibility skeleton
- Laying Out Graphs Using Queues
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- How to Draw a Graph
- Convex Maps
- Computing cartograms with optimal complexity
- How to walk your dog in the mountains with no magic leash
This page was built for publication: Homotopy height, grid-major height and graph-drawing height
