Algorithmic graph theory and perfect graphs /
Saved in:
| Author / Creator: | Golumbic, Martin Charles. |
|---|---|
| Edition: | 2nd ed. |
| Imprint: | Amsterdam : New York : Elsevier, 2004. |
| Description: | xxvi, 314 p. : ill. ; 25 cm. |
| Language: | English |
| Series: | Annals of discrete mathematics ; 57 |
| Subject: | |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/5135889 |
Table of Contents:
- Ch. 1. Graph Theoretic Foundations
- Ch. 2. The Design of Efficient Algorithms
- Ch. 3. Perfect Graphs
- Ch. 4. Triangulated Graphs
- Ch. 5. Comparability Graphs
- Ch. 6. Split Graphs
- Ch. 7. Permutation Graphs
- Ch. 8. Interval Graphs
- Ch. 9. Superperfect Graphs
- Ch. 10. Threshold Graphs
- Ch. 11. Not So Perfect Graphs
- Ch. 12. Perfect Gaussian Elimination
- App. A. A Small Collection of NP-Complete Problems
- App. B. An Algorithm for Set Union, Intersection, Difference, and Symmetric Difference of Two Subsets
- App. C. Topological Sorting: An Example of Algorithm 2.4
- App. D. An Illustration of the Decomposition Algorithm
- App. E. The Properties P.E.B., C.B., (P.E.B.)', (C.B.)' Illustrated
- App. F. The Properties C, C, T, T Illustrated.