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 条
  • [1] Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
    Éric Colin de Verdière
    Algorithmica, 2017, 78 : 1206 - 1224
  • [2] Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
    de Verdiere, Eric Colin
    ALGORITHMS - ESA 2015, 2015, 9294 : 373 - 385
  • [3] Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
    de Verdiere, Eric Colin
    ALGORITHMICA, 2017, 78 (04) : 1206 - 1224
  • [4] An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face
    Cédric Bentz
    Algorithmica, 2019, 81 : 224 - 237
  • [5] An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face
    Bentz, Cedric
    ALGORITHMICA, 2019, 81 (01) : 224 - 237
  • [6] A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals
    Cohen-Addad, Vincent
    de Verdiere, Eric Colin
    de Mesmay, Arnaud
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1439 - 1458
  • [7] A NEAR-LINEAR APPROXIMATION SCHEME FOR MULTICUTS OF EMBEDDED GRAPHS WITH A FIXED NUMBER OF TERMINALS
    Cohen-Addad, Vincent
    de Verdiere, Eric Colin
    de Mesmay, Arnaud
    SIAM JOURNAL ON COMPUTING, 2021, 50 (01) : 1 - 31
  • [8] AN ALGORITHM FOR STRAIGHT-LINE REPRESENTATION OF SIMPLE PLANAR GRAPHS
    WOO, L
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1969, 287 (03): : 197 - &
  • [9] Recursive sum-product algorithm for generalized outer-planar graphs
    Cheng, Qiang
    Chen, Feng
    Xu, Wenli
    Wang, Song
    INFORMATION PROCESSING LETTERS, 2012, 112 (11) : 449 - 456
  • [10] Outer 1-Planar Graphs
    Auer, Christopher
    Bachmaier, Christian
    Brandenburg, Franz J.
    Gleissner, Andreas
    Hanauer, Kathrin
    Neuwirth, Daniel
    Reislhuber, Josef
    ALGORITHMICA, 2016, 74 (04) : 1293 - 1320
12345