The following pages link to (Q3972953):
Displayed 15 items.
- The disjoint paths problem in quadratic time (Q412168) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- The extremal function for 3-linked graphs (Q947723) (← links)
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← links)
- Searching for \(f\)-Hamiltonian circuits (Q1196437) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- \(K_{a,k}\) minors in graphs of bounded tree-width (Q1850628) (← links)
- (Q2702747) (← links)
- Two disjoint negative cycles in a signed graph (Q3439485) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)