ON CUTS AND MATCHINGS IN PLANAR GRAPHS

被引：32
|
作者：
BARAHONA, F [1 ]
机构：
[1] UNIV WATERLOO, DEPT COMBINATOR & OPTIMIZAT, WATERLOO N2L 3G1, ONTARIO, CANADA
来源：
MATHEMATICAL PROGRAMMING | 1993年 / 60卷 / 01期
关键词：
CUT POLYTOPE; MATCHING; MULTICOMMODITY FLOWS;
D O I：
10.1007/BF01580600
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study the max cut problem in graphs not contractible to K5, and optimum perfect matchings in planar graphs. We prove that both problems can be formulated as polynomial size linear programs.
引用
收藏
页码：53 / 68
页数：16
相关论文
共 50 条
  • [31] Efficient algorithms for k-terminal cuts on planar graphs
    Chen, DZ
    Wu, XD
    ALGORITHMICA, 2004, 38 (02) : 299 - 316
  • [32] Mixed matchings in graphs
    Frankl, Peter
    DISCRETE MATHEMATICS, 2020, 343 (02)
  • [33] On flips in planar matchings
    Milich, Marcel
    Muetze, Torsten
    Pergel, Martin
    DISCRETE APPLIED MATHEMATICS, 2021, 289 : 427 - 445
  • [34] Matchings in graphs and groups
    Jarden, Adi
    Levit, Vadim E.
    Shwartz, Robert
    DISCRETE APPLIED MATHEMATICS, 2018, 247 : 216 - 224
  • [35] COUNTING MATCHINGS IN GRAPHS
    FARRELL, EJ
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1987, 324 (03): : 331 - 339
  • [36] On flips in planar matchings
    Milich, Marcel
    Mütze, Torsten
    Pergel, Martin
    Discrete Applied Mathematics, 2021, 289 : 427 - 445
  • [37] GRAPHS WITH THE FEWEST MATCHINGS
    Keough, Lauren
    Radcliffe, Andrew J.
    COMBINATORICA, 2016, 36 (06) : 703 - 723
  • [38] Graphs with the fewest matchings
    Lauren Keough
    Andrew J. Radcliffe
    Combinatorica, 2016, 36 : 703 - 723
  • [39] MATCHINGS IN REGULAR GRAPHS
    NADDEF, D
    PULLEYBLANK, WR
    DISCRETE MATHEMATICS, 1981, 34 (03) : 283 - 291
  • [40] Supereulerian graphs and matchings
    Lai, Hong-Jian
    Yan, Huiya
    APPLIED MATHEMATICS LETTERS, 2011, 24 (11) : 1867 - 1869
12345