Orthogonal planarity testing of bounded treewidth graphs
From MaRDI portal
Publication:2071827
DOI10.1016/j.jcss.2021.11.004OpenAlexW4200514496MaRDI QIDQ2071827
Giuseppe Liotta, Emilio Di Giacomo, Fabrizio Montecchiani
Publication date: 31 January 2022
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2021.11.004
Related Items (10)
Parameterized Algorithms for Queue Layouts ⋮ 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 ⋮ Rectilinear Planarity of Partial 2-Trees ⋮ Grid recognition: classical and parameterized computational perspectives ⋮ Parameterized approaches to orthogonal compaction ⋮ Recognizing map graphs of bounded treewidth ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Parameterized complexity of graph planarity with restricted cyclic orders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Planar graphs: Theory and algorithms
- 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
- Parameterized algorithms for book embedding problems
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- 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 database schemas
- Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Atomic Embeddability, Clustered Planarity, and Thickenability
- 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
- Accelerated Bend Minimization
This page was built for publication: Orthogonal planarity testing of bounded treewidth graphs
