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.

• New edition of the "Classic" book on the topic
• Wonderful introduction to a rich research area
• Leading author in the field of algorithmic graph theory
• Beautifully written for the new mathematician or computer scientist
• Comprehensive treatment

Table of Contents

CHAPTER 1 Graph Theoretic Foundations

CHAPTER 2 The Design of Efficient Algorithms

CHAPTER 3 Perfect Graphs

CHAPTER 4 Triangulated Graphs

CHAPTER 5 Comparability Graphs

CHAPTER 6 Split Graphs

CHAPTER 7 Permutation Graphs

CHAPTER 8 Interval Graphs

CHAPTER 9 Superperfect Graphs

CHAPTER 10 Thresho Id Graphs

CHAPTER 11 Not So Perfect Graphs

CHAPTER 12 Perfect Gaussian Elimination

Review

"... this volume is, as was its predecessor, an excellent and motivating introduction to the world of perfect graphs" --D. de Werra (CH-LSNP; Lausanne) in: Mathematical Reviews

About the Author

Martin Charles Golumbic is an American-born mathematician and computer scientist internationally recognized for his contributions to graph theory, combinatorics, and artificial intelligence. He earned his Ph.D. in Mathematics from Columbia University in 1975 and has held academic and research positions at institutions including New York University, Bell Laboratories, IBM Israel Scientific Center, Bar-Ilan University, and the University of Haifa, Israel, where he became Professor of Computer Science. His research focuses on perfect graphs, graph algorithms, tolerance graphs, temporal reasoning, and computational mathematics. He is the author of influential books, including Algorithmic Graph Theory and Perfect Graphs, and has received international academic recognition for his contributions to mathematics and computer science.