ABSTRACT
This chapter is a survey on perfect graphs with an algorithmic flavor. Our emphasis is on important classes of perfect graphs for which there are fast and efficient recognition and optimization algorithms. The classes of graphs we discuss in this chapter are chordal, comparability, interval, perfectly orderable, weakly chordal, perfectly contractile, and -bound graphs. For each of these classes, when appropriate we discuss the complexity of the recognition algorithm and algorithms for finding a minimum coloring, and a largest clique in the graph and in its complement.
