GENERAL VERTEX DISJOINT PATHS IN SERIES-PARALLEL GRAPHS

被引：6
|
作者：
KORACH, E
TAL, A
机构：
[1] Computer Science Department, Technion - Israel Institute of Technology, Haifa
来源：
DISCRETE APPLIED MATHEMATICS | 1993年 / 41卷 / 02期
关键词：
D O I：
10.1016/0166-218X(93)90035-M
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let G = (V,E) be an undirected graph and let (s(i),t(i)), 1 less-than-or-equal-to i less-than-or-equal-to k be k pairs of vertices in G. The vertex disjoint paths problem is to find k paths P(l), ..., 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.
引用
收藏
页码：147 / 164
页数：18
相关论文
共 50 条
  • [1] The edge-disjoint paths problem is NP-complete for series-parallel graphs
    Nishizeki, T
    Vygen, J
    Zhou, X
    [J]. DISCRETE APPLIED MATHEMATICS, 2001, 115 (1-3) : 177 - 186
  • [2] Vertex-disjoint paths in graphs
    Egawa, Y
    Ota, K
    [J]. ARS COMBINATORIA, 2001, 61 : 23 - 31
  • [3] Nonempty intersection of longest paths in series-parallel graphs
    Chen, Guantao
    Ehrenmuller, Julia
    Fernandes, Cristina G.
    Heise, Carl Georg
    Shan, Songling
    Yang, Ping
    Yates, Amy N.
    [J]. DISCRETE MATHEMATICS, 2017, 340 (03) : 287 - 304
  • [4] Selecting vertex disjoint paths in plane graphs
    Flier, Holger
    Mihalak, Matus
    Widmayer, Peter
    Zych, Anna
    Kobayashi, Yusuke
    Schoebel, Anita
    [J]. NETWORKS, 2015, 66 (02) : 136 - 144
  • [5] INTERSECTION GRAPHS OF VERTEX DISJOINT PATHS IN A TREE
    PANDA, BS
    MOHANTY, SP
    [J]. DISCRETE MATHEMATICS, 1995, 146 (1-3) : 179 - 209
  • [6] On vertex-disjoint paths in regular graphs
    Han, Jie
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (02):
  • [7] Vertex-disjoint paths in transposition graphs
    Fujita, Satoshi
    [J]. Proceedings of the 18th IASTED International Conference on Parallel and Distributed Computing and Systems, 2006, : 490 - 494
  • [8] COMPUTING THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT S-T PATHS IN A PROBABILISTIC BASICALLY SERIES-PARALLEL DIGRAPH
    CHENG, P
    MASUYAMA, S
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1993, E76A (12) : 2089 - 2094
  • [9] Vertex Cuts, Random Walks, and Dimension Reduction in Series-Parallel Graphs
    Brinkman, Bo
    Karagiozova, Adriana
    Lee, James R.
    [J]. STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 621 - 630
  • [10] Logspace algorithms for computing shortest and longest paths in series-parallel graphs
    Jakoby, Andreas
    Tantau, Till
    [J]. FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 216 - 227
12345