A polynomial algorithm for recognizing perfect graphs

被引：19
|
作者：
Cornuéjols, G [1 ]
Liu, XM [1 ]
Vuskovic, K [1 ]
机构：
[1] Univ Marseille, Dept Informat, Marseille, France
来源：
44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 2003年
关键词：
perfect graph; odd hole; recognition algorithm; decomposition; cleaning;
D O I：
10.1109/SFCS.2003.1238177
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a polynomial algorithm for recognizing whether a graph is perfect, thus settling a long standing open question. The algorithm uses a decomposition theorem of Conforti, Cornuejols and Vuskovic. Another polynomial algorithm for recognizing perfect graphs, which does not use decomposition, was obtained simultaneously by Chudnovsky and Seymour. Both algorithms need a first phase developed jointly by Chudnovsky, Cornuejols, Liu, Seymour and Vuskovic.
引用
收藏
页码：20 / 27
页数：8
相关论文
共 50 条
  • [1] A POLYNOMIAL ALGORITHM FOR RECOGNIZING CIRCLE GRAPHS
    BOUCHET, A
    [J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1985, 300 (16): : 569 - 572
  • [2] RECOGNIZING PLANAR PERFECT GRAPHS
    HSU, WL
    [J]. JOURNAL OF THE ACM, 1987, 34 (02) : 255 - 288
  • [3] Recognizing hyperelliptic graphs in polynomial time
    Bodewes, Jelco M.
    Bodlaender, Hans L.
    Cornelissen, Gunther
    van der Wegen, Marieke
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 815 : 121 - 146
  • [4] Recognizing dart-free perfect graphs
    Chvátal, V
    Fonlupt, J
    Sun, L
    Zemirline, A
    [J]. PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 50 - 53
  • [5] Recognizing dart-free perfect graphs
    Chvátal, V
    Fonlupt, J
    Sun, L
    Zemirline, A
    [J]. SIAM JOURNAL ON COMPUTING, 2002, 31 (05) : 1315 - 1338
  • [6] Recognizing perfect 2-split graphs
    Hoàng, CT
    Le, V
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2000, 13 (01) : 48 - 55
  • [7] RECOGNIZING CLAW-FREE PERFECT GRAPHS
    CHVATAL, V
    SBIHI, N
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1988, 44 (02) : 154 - 176
  • [8] RECOGNIZING BULL-FREE PERFECT GRAPHS
    REED, B
    SBIHI, N
    [J]. GRAPHS AND COMBINATORICS, 1995, 11 (02) : 171 - 178
  • [9] RECOGNIZING CIRCLE GRAPHS IN POLYNOMIAL-TIME
    GABOR, CP
    SUPOWIT, KJ
    HSU, WL
    [J]. JOURNAL OF THE ACM, 1989, 36 (03) : 435 - 473
  • [10] A POLYNOMIAL ALGORITHM FOR RECOGNIZING IMAGES OF POLYHEDRA
    KIROUSIS, LM
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 227 : 194 - 204
12345