Computing disjoint paths with length constraints
Authors:
- 1 January 1997
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 375-389
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A quick method for finding shortest pairs of disjoint pathsNetworks, 1984
- The complexity of finding maximum disjoint paths with length constraintsNetworks, 1982
- Disjoint paths in a networkNetworks, 1974