ON CUTS AND MATCHINGS IN PLANAR GRAPHS

被引:32
|
作者
BARAHONA, F [1 ]
机构
[1] UNIV WATERLOO, DEPT COMBINATOR & OPTIMIZAT, WATERLOO N2L 3G1, ONTARIO, CANADA
关键词
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 条
  • [41] MATCHINGS AND WALKS IN GRAPHS
    GODSIL, CD
    JOURNAL OF GRAPH THEORY, 1981, 5 (03) : 285 - 297
  • [42] COLLAPSIBLE GRAPHS AND MATCHINGS
    CHEN, ZH
    LAI, HJ
    JOURNAL OF GRAPH THEORY, 1993, 17 (05) : 597 - 605
  • [43] ON THE SIGNED MATCHINGS OF GRAPHS
    Javan, Samane
    Maimani, Hamid Reza
    FACTA UNIVERSITATIS-SERIES MATHEMATICS AND INFORMATICS, 2020, 35 (02): : 541 - 547
  • [44] LARGE MATCHINGS IN GRAPHS
    WEINSTEI.JM
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (03): : A362 - A362
  • [45] LARGE MATCHINGS IN GRAPHS
    WEINSTEIN, J
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1974, 26 (06): : 1498 - 1508
  • [46] MATCHINGS IN ARBITRARY GRAPHS
    BRUALDI, RA
    PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY-MATHEMATICAL AND PHYSICAL SCIENCES, 1971, 69 (MAY): : 401 - &
  • [47] Perfect matchings versus odd cuts
    Szigeti, Z
    COMBINATORICA, 2002, 22 (04) : 575 - 589
  • [48] Matchings on infinite graphs
    Bordenave, Charles
    Lelarge, Marc
    Salez, Justin
    PROBABILITY THEORY AND RELATED FIELDS, 2013, 157 (1-2) : 183 - 208
  • [49] MATCHINGS IN COUNTABLE GRAPHS
    STEFFENS, K
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1977, 29 (01): : 165 - 168
  • [50] Matchings on infinite graphs
    Charles Bordenave
    Marc Lelarge
    Justin Salez
    Probability Theory and Related Fields, 2013, 157 : 183 - 208