Skip to content

Algorithmic Graph Theory and Perfect Graphs

ISBN-10: 0444515305

ISBN-13: 9780444515308

Edition: 2nd 2004 (Revised)

Authors: Martin Charles Golumbic

Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Customers also bought

Book details

Edition: 2nd
Copyright year: 2004
Publisher: Elsevier Science & Technology Books
Publication date: 2/4/2004
Binding: Hardcover
Pages: 340
Size: 6.50" wide x 9.50" long x 0.75" tall
Weight: 1.694
Language: English

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