Fixed-parameter tractable algorithms for testing upward planarity
From MaRDI portal
Recommendations
Cited in
(14)- On the computational complexity of upward and rectilinear planarity testing
- Upward planarity testing in practice: SAT formulations and comparative study
- Upward Planarity Testing: A Computational Study
- Upward spirality and upward planarity testing
- An Improved Upward Planarity Testing Algorithm and Related Applications
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Vertex disjoint paths in upward planar graphs
- Upward Planar Drawings and Switch-regularity Heuristics
- A parameterized algorithm for upward planarity testing
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- Graph Drawing
- Graph Drawing
- Parameterized algorithms for upward planarity
- Improving the running time of embedded upward planarity testing
This page was built for publication: Fixed-parameter tractable algorithms for testing upward planarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711534)