Algorithmic graph theory and perfect graphs /

Show other versions (2)

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 sto...

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Author: Golumbic, Martin Charles
Format: Electronic eBook
Language:Inglés
Published: Amsterdam ; Boston : Elsevier, 2004.
©2004
Edition:2nd ed.
Series:Annals of discrete mathematics ; 57.
Subjects:
Perfect graphs.
Graphes parfaits.
MATHEMATICS > Graphic Methods.
Grafentheorie.
Teoria dos grafos.
Computabilidade e complexidade.
Programação matemática.
Programação inteira e fluxos em rede.
Online Access:Texto completo (Requiere registro previo con correo institucional)
Table of Contents:
  • Cover; Contents; Foreword 2004; Foreword; Preface; Acknowledgments; List of Symbols; Corrections and Errata; Chapter 1. Graph Theoretic Foundations; Chapter 2. The Design of Efficient Algorithms; Chapter 3. Perfect Graphs; Chapter 4. Triangulated Graphs; Chapter 5. Comparability Graphs; 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.

Similar Items