AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution

Efficient Graph Representations

About this Title

Jeremy P. Spinrad, Vanderbilt University, Nashville, TN

Publication: Fields Institute Monographs
Publication Year: 2003; Volume 19
ISBNs: 978-0-8218-2815-1 (print); 978-1-4704-3146-4 (online)
DOI: https://doi.org/10.1090/fim/019
MathSciNet review: MR1971502
MSC: Primary 05-02; Secondary 05C62, 05C75, 05C85, 68-02, 68R10

View full volume as PDF

Read more about this volume

Table of Contents

Download chapters as PDF

Front/Back Matter

• View this volume's front and back matter

Chapters

• Explanatory remarks
• Chapter 1. Introduction
• Chapter 2. Implicit representation
• Chapter 3. Intersection and containment representations
• Chapter 4. Real numbers in graph representations
• Chapter 5. Classes which use global information
• Chapter 6. Visibility graphs
• Chapter 7. Intersection of graph classes
• Chapter 8. Graph classes defined by forbidden subgraphs
• Chapter 9. Chordal bipartite graphs
• Chapter 10. Matrices
• Chapter 11. Decomposition
• Chapter 12. Elimination schemes
• Chapter 13. Recognition algorithms
• Chapter 14. Robust algorithms for optimization problems
• Chapter 15. Characterization and construction
• Chapter 16. Applications