On the parameterized complexity of bend-minimum orthogonal planarity
From MaRDI portal
Publication:6618248
DOI10.1007/978-3-031-49275-4_4MaRDI QIDQ6618248
Giacomo Ortali, Walter Didimo, Fabrizio Montecchiani, Giuseppe Liotta, Emilio Di Giacomo
Publication date: 14 October 2024
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Unnamed Item
- A better heuristic for orthogonal graph drawings
- HV-planarity: algorithms and complexity
- Orthogonal planarity testing of bounded treewidth graphs
- Planar rectilinear drawings of outerplanar graphs in linear time
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Upward Spirality and Upward Planarity Testing
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Spirality and Optimal Orthogonal Drawings
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- Dividing a Graph into Triconnected Components
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Accelerated Bend Minimization
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- Rectilinear planarity of partial 2-trees
- Testing upward planarity of partial 2-trees
Related Items (1)
This page was built for publication: On the parameterized complexity of bend-minimum orthogonal planarity
