Pages that link to "Item:Q3586454"
From MaRDI portal
The following pages link to Fast Minor Testing in Planar Graphs (Q3586454):
Displaying 6 items.
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- (Q3338271) (← links)
- On Linear Time Minor Tests with Depth-First Search (Q4033754) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)