Technical Report CS0646

TR#:CS0646
Class:CS
Title: DIRECTED VERTEX DISJOINT PATHS PROBLEM IN MIXED SERIES-PARALLEL GRAPHS
Authors: E. Korach and A. Tal
PDFCS0646.pdf
Abstract: Let G=(V,E) be a directed graph (or mixed graph) and let (Sj,l;) 1st ~ be k pairs of vertices in G. The directed vertex disjoint paths problem is to find k paths PI •... ,Pi such that P; is a directed path from Sj to t; and any two of these paths may intersect only at a common end point. This problem is NP-complete even for planar graphs. It is also NP-complete for general graphs where the number of paths is 2. We present a linear time algorithm for solving the directed problem on mixed graphs when the underline of the input graph is a series-parallel graph.
CopyrightThe 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/1990/CS/CS0646), 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 1990
To the main CS technical reports page

Computer science department, Technion
admin