- Published 1979 in J. ACM

A graph is an interval graph tf and only if each of Its verttces can be associated with an interval on the real hne m such a way that two vertices are adjacent m the graph exactly when the corresponding mtervals have a nonempty mtersectmn An effictent algonthrn for testing tsomorpinsm of interval graphs ts unplemented using a data structure called a PQ-tree. The algorithm runs m O(n + e) steps for graphs having n vemces and e edges It is shown that for a somewhat larger class of graphs, namely the chordal graphs, lsomorpinsm is as hard as for general graphs

Citations per Year

Semantic Scholar estimates that this publication has **147** citations based on the available data.

See our **FAQ** for additional information.

Showing 1-10 of 70 extracted citations

Highly Influenced

5 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

16 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

7 Excerpts

Highly Influenced

8 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

6 Excerpts

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=322125.

@article{Lueker1979ALT,
title={A Linear Time Algorithm for Deciding Interval Graph Isomorphism},
author={George S. Lueker and Kellogg S. Booth},
journal={J. ACM},
year={1979},
volume={26},
pages={183-195}
}