FINDING K-DISJOINT PATHS IN A DIRECTED PLANAR GRAPH

被引：51
|
作者：
SCHRIJVER, A [1 ]
机构：
[1] UNIV AMSTERDAM,DEPT MATH,1018 TV AMSTERDAM,NETHERLANDS
来源：
SIAM JOURNAL ON COMPUTING | 1994年 / 23卷 / 04期
关键词：
DISJOINT; PATH; DIRECTED; PLANAR; GRAPH; POLYNOMIAL-TIME; ALGORITHM; FREE GROUP; HOMOLOGOUS; C-HOMOLOGOUS;
D O I：
10.1137/S0097539792224061
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
It is shown that, for each fixed k, the problem of finding k pairwise vertex-disjoint directed paths between given pairs of terminals in a directed planar graph is solvable in polynomial time.
引用
收藏
页码：780 / 788
页数：9
相关论文
共 50 条
  • [1] Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph
    Yu, Chih-Chiang
    Lin, Chien-Hsin
    Wang, Biing-Feng
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (08) : 697 - 708
  • [2] The k-Disjoint Paths Problem on Chordal Graphs
    Kammer, Frank
    Tholey, Torsten
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 5911 : 190 - 201
  • [3] A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
    Bodlaender, Hans L.
    Penninkx, Eelko
    Tan, Richard B.
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 306 - 317
  • [4] Finding disjoint paths on directed acyclic graphs
    Tholey, T
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 319 - 330
  • [5] DISJOINT HOMOTOPIC PATHS AND TREES IN A PLANAR GRAPH
    SCHRIJVER, A
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1991, 6 (06) : 527 - 574
  • [6] DISJOINT PATHS IN A PLANAR GRAPH - A GENERAL THEOREM
    DING, GL
    SCHRIJVER, A
    SEYMOUR, PD
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1992, 5 (01) : 112 - 116
  • [7] k-Penalty: A Novel Approach to Find k-Disjoint Paths with Differentiated Path Costs
    Rak, Jacek
    [J]. IEEE COMMUNICATIONS LETTERS, 2010, 14 (04) : 354 - 356
  • [8] Efficient Approximation Algorithms for Computing k-Disjoint Minimum Cost Paths with Delay Constraint
    Guo, Longkun
    Shen, Hong
    [J]. 2012 13TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS, AND TECHNOLOGIES (PDCAT 2012), 2012, : 627 - 631
  • [9] Algorithms for K-DISJOINT maximum subarrays
    Bae, Sung Eun
    Takaoka, Tadao
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (02) : 319 - 339
  • [10] Finding k disjoint triangles in an arbitrary graph
    Fellows, M
    Heggernes, P
    Rosamond, F
    Sloper, C
    Telle, JA
    [J]. GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 235 - 244
12345