A Polynomial Algorithm for Recognizing Perfect Graphs

Authors:
Gérard Cornuéjols;Xinming Liu;Kristina Vuškovic
Affiliations:
-;-;-
Venue:
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Year:
2003

Citing 0
Cited 6

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

Computational Optimization and Applications
Chordless paths through three vertices

Theoretical Computer Science - Parameterized and exact computation
On the recognition of probe graphs of some self-complementary classes of perfect graphs

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Core stability of minimum coloring games

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Finding a smallest odd hole in a claw-free graph using global structure

Discrete Applied Mathematics
Automated generation of conjectures on forbidden subgraph characterization

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, Cornuéjols and Vu隆skovi驴. 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, Cornuéjols, Liu, Seymour and Vu隆skovi驴.