+612 9045 4394
 
CHECKOUT
Algorithmic Graph Theory and Perfect Graphs : Alorithmic Graph Theory and Peerfect Graphs, Second Edition - M.C. Golumbic

Algorithmic Graph Theory and Perfect Graphs

Alorithmic Graph Theory and Peerfect Graphs, Second Edition

Hardcover Published: 4th February 2004
ISBN: 9780444515308
Number Of Pages: 340

Share This Book:

Hardcover

$121.40
or 4 easy payments of $30.35 with Learn more
Ships in 15 business days

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

"(...) 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.

Foreword 2004
Foreword
Preface
Acknowledgments
List of Symbols
Corrections and Errata
Graph Theoretic Foundations
The Design of Efficient Algorithms
Perfect Graphs
Triangulated Graphs
Comparability Graphs
Split Graphs
Permutation Graphs
Interval Graphs
Superperfect Graphs
Threshold Graphs
Not So Perfect Graphs
Perfect Gaussian Elimination
A Small Collection of NP-Complete Problems
An Algorithm for Set Union, Intersection, Difference, and Symmetric Difference of Two Subsets
Topological Sorting: An Example of Algorithm 2.4
An Illustration of the Decomposition Algorithm
The Properties P.E.B., C.B., (P.E.B.)', (C.B.)' Illustrated
The Properties C, C, T, T Illustrated
Epilogue 2004
Index
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9780444515308
ISBN-10: 0444515305
Series: Annals of Discrete Mathematics
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 340
Published: 4th February 2004
Publisher: Elsevier Science & Technology
Country of Publication: US
Dimensions (cm): 24.0 x 16.5  x 1.91
Weight (kg): 0.66
Edition Number: 2
Edition Type: Revised