Efficient Graph Representations.: The Fields Institute for Research in Mathematical Sciences.

Front Cover
American Mathematical Soc., Jan 1, 2003 - Mathematics - 342 pages
0 Reviews
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Explanatory Remarks
1
Implicit Representation
17
Intersection and Containment Representations
31
Real Numbers in Graph Representations
53
Classes Which use Global Information
59
Visibility Graphs
73
Intersection of Graph Classes
85
Graph Classes Defined by Forbidden Subgraphs
97
Elimination Schemes
181
Recognition Algorithms
191
Robust Algorithms for Optimization Problems
231
Characterization and Construction
257
Applications
265
Glossary
277
Survey of Results on Graph Classes
303
Bibliography
319

Chordal Bipartite Graphs
111
Matrices
135
Decomposition
149

Other editions - View all

Common terms and phrases

Popular passages

Page 11 - A graph is an interval graph if one can associate with each vertex an interval on the real line such that two vertices are adjacent if and only if the corresponding intervals have a nonempty intersection.
Page 331 - A linear time algorithm for deciding interval graph isomorphism, Journal of the ACM, 26 (1979), 183-195.

References to this book

All Book Search results »

Bibliographic information