The following pages link to Rooted routing in the plane (Q1346696):
Displayed 9 items.
- The disjoint paths problem in quadratic time (Q412168) (← links)
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)