Algorithmic Graph Theory and Perfect Graphs

Martin Charles Golumbic

Elsevier, 04.02.2004 - 340 Seiten

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

Inhalt

• Chapter 1 Graph Theoretic Foundations: 1
• Chapter 2 The Design of Efficient Algorithms: 22
• Chapter 3 Perfect Graphs: 51
• Chapter 4 Triangulated Graphs: 81
• Chapter 5 Comparability Graphs: 105
• Chapter 6 Split Graphs: 149
• Chapter 7 Permutation Graphs: 157
• Chapter 8 Interval Graphs: 171
• Chapter 9 Superperfect Graphs: 203
• Chapter 10 Threshold Graphs: 219
• Chapter 11 Not So Perfect Graphs: 235
• Chapter 12 Perfect Gaussian Elimination: 254
• Appendix: 269
• Epilogue 2004: 277
• Index: 307

Bibliografische Informationen

• Titel: Algorithmic Graph Theory and Perfect Graphs
• Autor/in: Martin Charles Golumbic
• Ausgabe: 2
• Verlag: Elsevier, 2004
• ISBN: 0080526969, 9780080526966
• Länge: 340 Seiten