The complexity of finding two disjoint paths with min-max objective function
- 1 January 1990
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 26 (1) , 105-115
- https://doi.org/10.1016/0166-218x(90)90024-7
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- A quick method for finding shortest pairs of disjoint pathsNetworks, 1984
- The complexity of finding maximum disjoint paths with length constraintsNetworks, 1982
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- Disjoint paths in a networkNetworks, 1974