By
Martin Golumbic, University of Haifa, Isreal.
Description
Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals
edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems.
It remains a stepping stone from which the reader may embark on one of many fascinating research trails.
The past twenty years have
been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have
been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs.
These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this
second edition.
Included in series
Annals of Discrete Mathematics
Audience:
Mathematic and Computing Libraries, and Graduate Students.
