A polynomial algorithm for recognizing perfect graphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 20-27

  Cornuéjols, Gérard ^a,b   Liu, Xinming ^b   Vušković, Kristina ^c  

^a AIX MARSEILLE UNIVERSITY   (France)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Cleaning; Decomposition; Odd hole; Perfect graph; Recognition algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; THEOREM PROVING; ARTIFICIAL INTELLIGENCE; CLEANING; COMPUTER SCIENCE; DOMAIN DECOMPOSITION METHODS; GRAPH THEORY; SUN;

GRAPH RECOGNITION; ODD HOLE; PERFECT GRAPH; POLYNOMIAL ALGORITHM; RECOGNITION ALGORITHM;

GRAPH THEORY; ALGORITHMS;

DECOMPOSITION THEOREMS; PERFECT GRAPH; POLYNOMIAL ALGORITHM;

EID: 0344118906     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. C. Berge, Farbung von Graphen deren samtliche bzw. Deren ungerade Kreise starr sind (Zusammenfassung), Wissenschaftliche Zeitschrift, Martin Luther Universität Halle-Wittenberg, Mathematische-Naturwissenschaftliche Reihe (1961) 114-115.
2. D. Bienstock, On complexity of testing for odd holes and induced odd paths, Discrete Mathematics 90 (1991) 85-92.
3. M. Burlet and J. Fonlupt, Polynomial algorithm to recognize a Meyniel graph, Ann of Discrete Math 21 (1984) 225-252.
4. V. Chavátal, J. Fonlupt, L. Sun and A. Zemirline, Recognizing dart-free perfect graphs, SIAM Journal on Computing 31 (2002) 1315-1338.
5. V. Chvátal and N. Sbihi, Recognizing claw-free perfect graphs, Journal of Combinatorial Theory B 44 (1988) 154-176.
6. M. Chudnovsky, PhD dissertation, forthcoming, 2003.
7. M. Chudnovsky, G. Cornuéjols, X. Liu, P. Seymour and K. Vušković, Cleaning for Bergeness, preprint (2003).
8. M. Chudnovsky, N. Robertson, P. Seymour and R. Thomas, The strong perfect graph theorem, preprint (2002).
9. M. Chudnovsky and P. Seymour, Recognizing Berge graphs, preprint (2003).
10. M. Conforti, G. Cornuéjols, A. Kapoor and K. Vušković, Balanced 0,±1 matrices II: Recognition algorithm, Journal of Combinatorial Theory B 81 (2001) 275-306.
11. M. Conforti, G. Cornuéjols, A. Kapoor and K. Vušović, Even-hole-free graphs, Part II: Recognition algorithm, Journal of Graph Theory 40 (2002) 238-266.
12. M. Conforti, G. Cornuéjols and M.R. Rao, Decompositions of balanced matrices, Journal of Combinatorial Theory B 77 (1999) 292-406.
13. M. Conforti, G. Cornuéjols and K. Vušković, Decomposition of odd-hole-free graphs by double star cutsets and 2-joins, preprint (2001), to appear in the special issue of Discrete Applied Mathematics dedicated to the Brazilian Symposium on Graphs, Algorithms and Combinatorics, Fortaleza, March 17-19, 2001.
14. M. Conforti and M.R. Rao, Structural properties and decomposition of linear balanced matrices, Mathematical Programming 55 (1992) 129-168.
15. G. Cornuéjols and W.H. Cunningham, Compositions for perfect graphs, Discrete Mathematics 55 (1985) 245-254.
16. G. Cornuéjols, X. Liu and K. Vušković, A polynomial algorithm for recognizing perfect graphs, preprint (2003).
17. B.A. Reed and N. Sbihi, Recognizing bull-free perfect graphs, Graphs Combin 11 (1995) 171-178.
18. D. B. West, Introduction to Graph Theory, Prentice Hall, (1996).