Algorithmic Graph Theory and Perfect Graphs: Second Edition

Front Cover
Elsevier, Feb 4, 2004 - Computers - 340 pages
1 Review

ELSEVIER SALE - ALL SCIENCE AND TECHNOLOGY BOOKS 50% OFF - ONE WEEK ONLY

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

  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

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
Copyright

Common terms and phrases

References to this book

All Book Search results »

About the author (2004)

Martin Charles Golumbic is Professor of Computer Science and Director of the Caesarea Edmond Benjamin de Rothschild Foundation Institute for Interdisciplinary Applications of Computer Science at the University of Haifa. He is the editor of the book "Advances in Artificial Intelligence, Natural Language and Knowledge-based Systems" (Springer, 1990), the author of the book "Algorithmic Graph Theory and Perfect Graphs" (second edition, Elsevier 2004), coauthor of a second book "Tolerance Graphs" (Cambridge University Press, 2004), and the founding editor-in-chief of the journal series "Annals of Mathematics and Artificial Intelligence" (Springer). Professor Golumbic received his Ph.D. in mathematics from Columbia University in 1975, and has previously held positions at New York University, Bell Laboratories, IBM Israel and Bar-Ilan University as well as visiting positions at UniversitA(c) de Paris, the Weizmann Institute of Science, and Ecole Polytechnique FA(c)dA(c)rale de Lausanne. He has given guest lectures in 15 states in the U.S.A. and in 20 other countries, and he was elected as a Fellow of the European Artificial Intelligence society ECCAI in 2005.

Bibliographic information