Pages that link to "Item:Q1759679"
From MaRDI portal
The following pages link to Fast minor testing in planar graphs (Q1759679):
Displaying 8 items.
- The complexity of induced minors and related problems (Q1346772) (← links)
- Computing small pivot-minors (Q1627161) (← links)
- (Q3338271) (← links)
- Faster Parameterized Algorithms for Minor Containment (Q3569902) (← links)
- On Linear Time Minor Tests with Depth-First Search (Q4033754) (← links)
- Branch decompositions and minor containment (Q4446913) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Minor embedding in broken chimera and derived graphs is NP-complete (Q6201320) (← links)