Sketched representations and orthogonal planarity of bounded treewidth graphs
From MaRDI portal
Publication:2206871
DOI10.1007/978-3-030-35802-0_29OpenAlexW2991380645MaRDI QIDQ2206871
Fabrizio Montecchiani, Emilio Di Giacomo, Giuseppe Liotta
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.05015
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Planar rectilinear drawings of outerplanar graphs in linear time ⋮ Fixed-parameter tractability for book drawing with bounded number of crossings per edge ⋮ Parameterized analysis and crossing minimization problems ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time ⋮ Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
Cites Work
- Unnamed Item
- Unnamed Item
- Orthogonal graph drawing with flexibility constraints
- Orthogonal graph drawing with inflexible edges
- Fixed parameter algorithms for one-sided crossing minimization revisited
- On the parameterized complexity of layered graph drawing
- Treewidth. Computations and approximations
- A better heuristic for orthogonal graph drawings
- HV-planarity: algorithms and complexity
- Bend-minimum orthogonal drawings in quadratic time
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
- Upward Spirality and Upward Planarity Testing
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- Graph minors. II. Algorithmic aspects of tree-width
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Spirality and Optimal Orthogonal Drawings
- Parameterized Complexity of 1-Planarity
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
- Drawing HV-Restricted Planar Graphs
- Algorithms – ESA 2004
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Morphing orthogonal planar graph drawings
