Pages that link to "Item:Q2367446"
From MaRDI portal
The following pages link to On the complexity of the disjoint paths problem (Q2367446):
Displaying 14 items.
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- (Q5090955) (← links)
- (Q5091049) (← links)
- The widest<i>k</i>-set of disjoint paths problem (Q5880971) (← links)
- The complexity of path coloring and call scheduling (Q5941061) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- Solving the edge‐disjoint paths problem using a two‐stage method (Q6066718) (← links)
- On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems (Q6087136) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)
- Finding edge-disjoint paths in partial k-trees (Q6487440) (← links)
- Temporal segmentation in multi agent path finding with applications to explainability (Q6566611) (← links)