The following pages link to On the disjoint paths problem (Q2643811):
Displaying 23 items.
- Edge-disjoint paths in digraphs with bounded independence number (Q473097) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (Q657914) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- On the Euclidean two paths problem (Q1315995) (← links)
- The unimodular intersection problem (Q1785442) (← links)
- Finding multiple induced disjoint paths in general graphs (Q1944193) (← links)
- On the complexity of the disjoint paths problem (Q2367446) (← links)
- A linear programming formulation of Mader's edge-disjoint paths problem (Q2581506) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- The maximum edge-disjoint paths problem in bidirected trees (Q2753529) (← links)
- Approximation algorithms for disjoint paths and related routing and packing problems (Q2757635) (← links)
- BFS Solution for Disjoint Paths in P Systems (Q3007713) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- (Q4940083) (← links)
- Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids (Q4943081) (← links)
- On Routing Disjoint Paths in Bounded Treewidth Graphs (Q5369517) (← links)
- The widest<i>k</i>-set of disjoint paths problem (Q5880971) (← links)
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals (Q6057790) (← links)
