|Title:||General Vertex Disjoint Paths in Series-Parallel Graphs
|Authors:||E. Korach and A. Tal
|Abstract:||Let G=(V,E) be an undirected graph and let (si,ti) 1<=i<=k be k pairs of vertices in G. The vertex disjoint paths problem is to find k paths P1...,Pk such that Pi connects si and ti and any two of these paths may intersect only at a common end point. This problem is NP-complete even for planar graphs. Robertson and Seymour proved that when k is a fixed integer this problem becomes polynomial. We present a linear time algorithm for solving the general problem when the input graph is a series-parallel graph.|
|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/1989/CS/CS0559), 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 1989
To the main CS technical reports page
Computer science department, Technion