General vertex disjoint paths in series-parallel graphs

Ephraim Korach; Ady Tal

doi:10.1016/0166-218X(93)90035-M

General vertex disjoint paths in series-parallel graphs

Ephraim Korach, Ady Tal

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

Let G = (V, E) be an undirected graph and let (s_i,t_i), 1 ≤ i ≤ k be k pairs of vertices in G. The vertex disjoint paths problem is to find k paths P₁,...,P_k such that P_i connects s_i and t_i and any two of these paths may intersect only at a common endpoint. 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 decision version of the general problem when the input graph is a series-parallel graph.

Original language	English
Pages (from-to)	147-164
Number of pages	18
Journal	Discrete Applied Mathematics
Volume	41
Issue number	2
DOIs	https://doi.org/10.1016/0166-218X(93)90035-M
State	Published - 26 Jan 1993
Externally published	Yes

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/0166-218X(93)90035-M

Cite this

@article{cd011bd29d7943859a6cf6ab15967618,

title = "General vertex disjoint paths in series-parallel graphs",

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 endpoint. 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 decision version of the general problem when the input graph is a series-parallel graph.",

author = "Ephraim Korach and Ady Tal",

year = "1993",

month = jan,

day = "26",

doi = "10.1016/0166-218X(93)90035-M",

language = "English",

volume = "41",

pages = "147--164",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - General vertex disjoint paths in series-parallel graphs

AU - Korach, Ephraim

AU - Tal, Ady

PY - 1993/1/26

Y1 - 1993/1/26

N2 - 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 endpoint. 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 decision version of the general problem when the input graph is a series-parallel graph.

AB - 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 endpoint. 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 decision version of the general problem when the input graph is a series-parallel graph.

UR - http://www.scopus.com/inward/record.url?scp=38249006816&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(93)90035-M

DO - 10.1016/0166-218X(93)90035-M

M3 - Article

AN - SCOPUS:38249006816

SN - 0166-218X

VL - 41

SP - 147

EP - 164

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 2

ER -

General vertex disjoint paths in series-parallel graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this