On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
From MaRDI portal
Publication:5321707
DOI10.1007/978-3-642-02270-8_18zbMath1248.68531OpenAlexW1858930179MaRDI QIDQ5321707
Publication date: 14 July 2009
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_18
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Canonical ordering trees and their applications in graph drawing
- A left-first search algorithm for planar graphs
- NP-Completeness of st-Orientations for Plane Graphs
- On Representation of Planar Graphs by Segments
- Straight-Line Drawing of Quadrangulations
- Rectangular duals of planar graphs
- On Finding the Rectangular Duals of Planar Triangular Graphs
- Graph Drawing