Book 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.
- 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
- Cover image
- Title page
- Table of Contents
- Copyright page
- Dedication
- Foreword 2004: The annals edition
- Foreword
- Preface
- Acknowledgments
- List of symbols
- Corrections and errata to: Algorithmic graph theory and perfect graphs, the original 1980 edition
- Chapter 1: Graph Theoretic Foundations
- Chapter 2: The Design of Efficient Algorithms
- Chapter 3: Perfect graphs
-
Chapter 4: Triangulated graphs
- Publisher Summary
- 1 Introduction
- 2 Characterizing Triangulated Graphs
- 3 Recognizing Triangulated Graphs by Lexicographic Breadth-First Search
- 4 The Complexity of Recognizing Triangulated Graphs
- 5 Triangulated Graphs as Intersection Graphs
- 6 Triangulated Graphs Are Perfect
- 7 Fast Algorithms for the COLORING, CLIQUE, STABLE SET, and CLIQUE-COVER Problems on Triangulated Graphs
- EXERCISES
-
Chapter 5: Comparability graphs
- Publisher Summary
- 1 Γ-Chains and Implication Classes
- 2 Uniquely Partially Orderable Graphs
- 3 The Number of Transitive Orientations
- 4 Schemes and G-Decompositions—An Algorithm for Assigning Transitive Orientations
- 5 The Γ*-Matroid of a Graph
- 6 The Complexity of Comparability Graph Recognition
- 7 Coloring and Other Problems on Comparability Graphs
- 8 The Dimension of Partial Orders
- Exercises
- Chapter 6: Split graphs
- Chapter 7: Permutation graphs
- Chapter 8: Interval graphs
- Chapter 9: Superperfect graphs
- Chapter 10: Threshold graphs
- Chapter 11: Not So Perfect Graphs
- Chapter 12: Perfect Gaussian Elimination
- Appendix
- Epilogue 2004
- Index
Product information
- Title: Algorithmic Graph Theory and Perfect Graphs, 2nd Edition
- Author(s):
- Release date: February 2004
- Publisher(s): North Holland
- ISBN: 9780080526966
You might also like
book
Graph Algorithms
Learn how graph algorithms can help you leverage relationships within your data to develop intelligent solutions …
book
Advanced Graph Theory and Combinatorics
Advanced Graph Theory focuses on some of the main notions arising in graph theory with an …
book
Handbook of Graph Theory, 2nd Edition
With 34 new contributors, this best-selling handbook provides comprehensive coverage of the main topics in pure …
book
Algorithms and Data Structures for Massive Datasets
Massive modern datasets make traditional data structures and algorithms grind to a halt. This fun and …