Pages that link to "Item:Q1969940"
From MaRDI portal
The following pages link to Finding edge-disjoint paths in partial \(k\)-trees (Q1969940):
Displayed 7 items.
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- (Q5136255) (← links)
- Walking through waypoints (Q5918830) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)