The following pages link to (Q4273851):
Displayed 10 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)
- Rooted routing in the plane (Q1346696) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- Planar Disjoint-Paths Completion (Q2891339) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529) (← links)