Efficient graph representations

Abstract

Explanatory remarks Introduction Implicit representation Intersection and containment representations Real numbers in graph representations Classes which use global information Visibility graphs Intersection of graph classes Graph classes defined by forbidden subgraphs Chordal bipartite graphs Matrices Decomposition Elimination schemes Recognition algorithms Robust algorithms for optimization problems Characterization and construction Applications Glossary Survey of results on graph classes Bibliography Index.