A simple algorithm for multicuts in planar graphs with outer terminals

被引：5
|
作者：
Bentz, Cedric [1 ,2 ]
机构：
[1] Univ Paris 11, LRI, F-91405 Orsay, France
[2] CNRS, F-91405 Orsay, France
来源：
DISCRETE APPLIED MATHEMATICS | 2009年 / 157卷 / 08期
关键词：
Multicuts; Planar graphs; Graph algorithms; BOUNDED TREE-WIDTH; DISJOINT PATHS; CUTS; COMPLEXITY; DIGRAPHS;
D O I：
10.1016/j.dam.2008.11.010
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Given an edge-weighted graph G and a list of source-sink pairs of terminal vertices of G, the minimum multicut problem consists in selecting a minimum weight set of edges of G whose removal leaves no path from the ith source to the ith sink, for each i. Few tractable special cases are known for this problem. In this paper, we give a simple polynomial-time algorithm solving it in undirected planar graphs where (I) all the terminals lie on the outer face and (II) there is a bounded number of terminals. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：1959 / 1964
页数：6
相关论文
共 50 条
  • [41] Maxima of the Q-index for outer-planar graphs
    Yu, Guanglong
    Guo, Shu-Guang
    Wu, Yarong
    LINEAR & MULTILINEAR ALGEBRA, 2015, 63 (09): : 1837 - 1848
  • [42] Drawing Outer 1-planar Graphs with Few Slopes
    Di Giacomo, Emilio
    Liotta, Giuseppe
    Montecchiani, Fabrizio
    GRAPH DRAWING (GD 2014), 2014, 8871 : 174 - 185
  • [43] On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
    Werner Schwärzler
    Combinatorica, 2009, 29 : 121 - 126
  • [44] Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
    Keuper, M.
    Levinkov, E.
    Bonneel, N.
    Lavoue, G.
    Brox, T.
    Andres, B.
    2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, : 1751 - 1759
  • [45] On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
    Schwaerzler, Werner
    COMBINATORICA, 2009, 29 (01) : 121 - 126
  • [46] An edge-splitting algorithm in planar graphs
    Nagamochi, H
    Eades, P
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2003, 7 (02) : 137 - 159
  • [47] An optimal algorithm for product structure in planar graphs
    Bose, Prosenjit
    Morin, Pat
    Odak, Saeed
    arXiv, 2022,
  • [48] Algorithm and experiments in testing planar graphs for isomorphism
    Kukluk, Jacek P.
    Holder, Lawrence B.
    Cook, Diane J.
    Journal of Graph Algorithms and Applications, 2004, 8 (03) : 313 - 356
  • [49] An Edge-Splitting Algorithm in Planar Graphs
    Hiroshi Nagamochi
    Peter Eades
    Journal of Combinatorial Optimization, 2003, 7 : 137 - 159
  • [50] A Fast Algorithm for the Product Structure of Planar Graphs
    Morin, Pat
    ALGORITHMICA, 2021, 83 (05) : 1544 - 1558
12345