Intersection graph algorithms

Front Cover
Cornell University, August, 1984 - Mathematics - 270 pages
0 Reviews
An intersection graph for a set of sets $C$ is a graph $G$ together with a bijection from the vertices of $G$ to $C$ such that distinct vertices in $G$ are adjacent if and only if their images under this bijection intersect. Of particular interest have been the classes of chordal graphs, the intersection graphs of sets of subtrees of a tree, and interval graphs, the intersection graphs of sets of intervals of the real line.

From inside the book

What people are saying - Write a review

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

Contents

Definitions and Background
4
Directed Path Hypergraphs and Partial Path Trees
23
Algorithms on Partial Path Trees
42

3 other sections not shown

Common terms and phrases

Bibliographic information