Pages that link to "Item:Q5493896"
From MaRDI portal
The following pages link to TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY (Q5493896):
Displaying 16 items.
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- Improving the running time of embedded upward planarity testing (Q991781) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Upward planar drawings with three and more slopes (Q2151439) (← links)
- Quasi-upward planar drawings with minimum curve complexity (Q2151443) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
- Upward and quasi-upward planarity testing of embedded mixed graphs (Q2437763) (← links)
- On the computational complexity of upward and rectilinear planarity testing (Q2784472) (← links)
- Upward Planarity Testing: A Computational Study (Q2867639) (← links)
- Optimal Upward Planarity Testing of Single-Source Digraphs (Q4388867) (← links)
- Upward planar drawings with two slopes (Q5084713) (← links)
- Upward Planar Drawings with Three and More Slopes (Q5886036) (← links)
- Graph Drawing (Q5897658) (← links)
- Testing upward planarity of partial 2-trees (Q6117044) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)