Pages that link to "Item:Q1934314"
From MaRDI portal
The following pages link to Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314):
Displayed 10 items.
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
- Planar Digraphs (Q3120437) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)