|Title:||The Complexity of Finding Maximum Disjoint Paths With Length Constraints
|Authors:||A. Itai, Y. Perl and Y. Shiloach
|Abstract:||The following problem is considered: Given an integer K, a graph G with two distinct vertices sand t, find the maximum number of disjoint paths of length K from s to t. The problem has several variants: the paths may be vertex-disjoint or edge-disjoint, the lengths of the paths may be equal to K or bounded by' K, the graph may be un~irected or directed. It is shown that except for small values of K all the problems are NP-complete. for each proolem, the largest value of-K for which the problem is not NP-complete is found. Whenever a polynomial algorithm exists, an efficient algorithm is described.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1977/CS/CS0094), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1977
To the main CS technical reports page
Computer science department, Technion