Efficient Algorithms for k-Disjoint Paths Problems on DAGs
Authors:
- 25 June 2007
- book chapter
- Published by Springer Nature
- p. 134-143
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Finding Two Disjoint Paths in a Network with Normalized α + -MIN-SUM Objective Function2005
- Approximation Schemes for the Restricted Shortest Path ProblemMathematics of Operations Research, 1992
- The complexity of finding two disjoint paths with min-max objective functionDiscrete Applied Mathematics, 1990
- A quick method for finding shortest pairs of disjoint pathsNetworks, 1984
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a GraphJournal of the ACM, 1978
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Recent results on generalized Ramsey theory for graphs1972