Pages that link to "Item:Q414938"
From MaRDI portal
The following pages link to A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938):
Displaying 19 items.
- Graph editing to a fixed target (Q344855) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Induced disjoint paths problem in a planar digraph (Q967379) (← links)
- Induced circuits in planar graphs (Q1322013) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
- Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
- A near-linear-time algorithm for computing replacement paths in planar directed graphs (Q2930346) (← links)
- (Q3326860) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- (Q4273851) (← links)
- LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS (Q4886310) (← links)
- An exponential time parameterized algorithm for planar disjoint paths (Q5145014) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- Parameterizing path partitions (Q6664058) (← links)
