Algorithmic Graph Theory and Perfect Graphs

✍ Scribed by Martin Charles Golumbic and Werner Rheinboldt (Auth.)

• Publisher: Elsevier Inc, Academic Press
• Year: 1980
• Tongue: English
• Leaves: 294
• Series: Computer science and applied mathematics
• Category: Library

✦ Synopsis

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

Content:
Front Matter, Page iii
Copyright, Page iv
Dedication, Page v
Foreword, Pages xiii-xiv
Preface, Pages xv-xvi
Acknowledgments, Page xvii
List of Symbols, Pages xix-xx
CHAPTER 1 - Graph Theoretic Foundations, Pages 1-21
CHAPTER 2 - The Design of Efficient Algorithms, Pages 22-50
CHAPTER 3 - Perfect Graphs, Pages 51-80
CHAPTER 4 - Triangulated Graphs, Pages 81-104
CHAPTER 5 - Comparability Graphs, Pages 105-148
CHAPTER 6 - Split Graphs, Pages 149-156
CHAPTER 7 - Permutation Graphs, Pages 157-170
CHAPTER 8 - Interval Graphs, Pages 171-202
CHAPTER 9 - Superperfect Graphs, Pages 203-218
CHAPTER 10 - Threshold Graphs, Pages 219-234
CHAPTER 11 - Not So Perfect Graphs, Pages 235-253
CHAPTER 12 - Perfect Gaussian Elimination, Pages 254-267
Appendix, Pages 269-275
Index, Pages 277-284
Computer Science and Applied Mathematics, Pages ibc1-ibc2