RECOGNIZING PLANAR PERFECT GRAPHS

被引：25
|
作者：
HSU, WL
机构：
来源：
JOURNAL OF THE ACM | 1987年 / 34卷 / 02期
关键词：
D O I：
10.1145/23005.31330
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：255 / 288
页数：34
相关论文
共 50 条
  • [1] Recognizing Planar Laman Graphs
    Rollin, Jonathan
    Schlipf, Lena
    Schulz, Andre
    [J]. 27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [2] A polynomial algorithm for recognizing perfect graphs
    Cornuéjols, G
    Liu, XM
    Vuskovic, K
    [J]. 44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 20 - 27
  • [3] 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
  • [4] Recognizing dart-free perfect graphs
    Chvátal, V
    Fonlupt, J
    Sun, L
    Zemirline, A
    [J]. SIAM JOURNAL ON COMPUTING, 2002, 31 (05) : 1315 - 1338
  • [5] Recognizing perfect 2-split graphs
    Hoàng, CT
    Le, V
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2000, 13 (01) : 48 - 55
  • [6] RECOGNIZING CLAW-FREE PERFECT GRAPHS
    CHVATAL, V
    SBIHI, N
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1988, 44 (02) : 154 - 176
  • [7] RECOGNIZING BULL-FREE PERFECT GRAPHS
    REED, B
    SBIHI, N
    [J]. GRAPHS AND COMBINATORICS, 1995, 11 (02) : 171 - 178
  • [8] AN ALGORITHM FOR COLORING PERFECT PLANAR GRAPHS
    STEWART, IA
    [J]. INFORMATION PROCESSING LETTERS, 1989, 31 (02) : 97 - 101
  • [9] AN ALGORITHM FOR COLORING PERFECT PLANAR GRAPHS
    STEWART, IA
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 287 : 58 - 64
  • [10] COLORING PERFECT PLANAR GRAPHS IN PARALLEL
    STEWART, IA
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 344 : 268 - 275
12345