Pages that link to "Item:Q412168"
From MaRDI portal
The following pages link to The disjoint paths problem in quadratic time (Q412168):
Displayed 16 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Rooted \(K_4\)-minors (Q396793) (← links)
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (Q2804992) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)