A Linear Time Algorithm for Deciding Interval Graph Isomorphism

Abstract

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

DOI: 10.1145/322123.322125

Extracted Key Phrases

5 Figures and Tables

01020'80'83'87'91'95'99'03'07'11'15
Citations per Year

147 Citations

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

See our FAQ for additional information.

Cite this paper

@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} }