Drawing Planar Graphs with Reduced Height
From MaRDI portal
Publication:5892364
DOI10.7155/jgaa.00424zbMath1358.05074OpenAlexW2580612870MaRDI QIDQ5892364
Stephane Durocher, Debajyoti Mondal
Publication date: 5 April 2017
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00424
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Small grid drawings of planar graphs with balanced partition
- 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
- Minimum-width grid drawings of plane graphs
- Reduced constants for simple cycle graph separation
- A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs
- Trade-Offs in Planar Polyline Drawings
- Height-Preserving Transformations of Planar Graph Drawings
- Minimum-Layer Drawings of Trees
- Minimum-Area Drawings of Plane 3-Trees
- Drawing Graphs on Two and Three Lines
- Towards an implementation of the 3D visibility skeleton
- Edge Separators of Planar and Outerplanar Graphs With Applications
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Universal Line-Sets for Drawing Planar 3-Trees
- Drawing Planar Graphs on Area
- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
- Drawing Planar Graphs with Reduced Height
- Graph Drawing