Algorithmic Graph Theory and Perfect Graphs book cover

Algorithmic Graph Theory and Perfect Graphs

Second Edition

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.

Audience
Mathematic and Computing Libraries, and Graduate Students.

Hardbound, 340 Pages

Published: February 2004

Imprint: North-holland

ISBN: 978-0-444-51530-8

Reviews

  • "(...) 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 2005e: 05061.

Contents

  • Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals version 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. A new Epilogue chapter in this second edition surveys many of the recent results in the area. It also gives pointers for further study. The book has served to unify the topic and to act as a spring board for researchers, and especially graduate students, to pursue new directions of investigation. The book is also suitable as the text for a seminar or special topics course in graph theory and combinatorial mathematics.The book covers many applications associated with classes of perfect graphs, including scheduling problems and resource. The important classes of interval graphs and permutation graphs are studied, as well as comparability graph and chordal graphs. Coloring problems on perfect graphs in polynomial time is especially important in scheduling applications. This book provides a comprehensive treatment and includes proofs of the major results. It remains is very timely in the development of the field, and the unified approach presented should be very useful for those learning and working in graph theory.

Advertisement

advert image