Computing disjoint paths with length constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1197 LNCS, Issue , 1997, Pages 375-389

  Tragoudas, Spyros ^a   Varol, Yaakov L ^b  

^a Southern Illinois University Carbondale   (United States)

^b University of Nevada   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; DISJOINT PATHS; EDGE DISJOINT PATHS; LENGTH CONSTRAINTS; NODE PAIRS; NP COMPLETE; NP-HARD; UNDIRECTED GRAPH;

GRAPH THEORY; OPTIMIZATION;

COMPUTER SCIENCE;

EID: 84896693809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62559-3_30     Document Type: Conference Paper

References (6)

1. Itai A., Perl Y., Shiloach Y.: The Complexity of Finding Maximum Disjoint Paths with Length Constraints. Networks 12 (1982) 277-286
2. Garey M.R., Johnson D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, NY, 1979
3. Shiloach Y.: The Two Paths Problem is Polynomially Solvable. Report STAN-CS-78-654. Computer Science Department, Stanford University, Stanford, CA
4. Suurballe, J.W.: Disjoint Paths in a Network. Networks 4 (1974) 125-145
5. Suurballe, J.W., Tarjan, R.E.: A Quick Method for Finding Shortest Pairs of Disjoint Paths. Networks 14 (1984) 325-336
6. Tragoudas, S., Varol Y.L.: On the Computation of Disjoint Paths with Length Constraints. Technical Report 96-6. Computer Science Department, Southern Illinois Univerity, Carbondale, IL 62901