论文信息 - A Linear Time Algorithm for Deciding Interval Graph Isomorphism

A Linear Time Algorithm for Deciding Interval Graph Isomorphism

Author(s): Lueker, George S.; Booth, Kellogg S. | Abstract: A graph is an interval graph if and only if each of its vertices can be associated with an interval on the real line in such a way that two vertices are adjacent in the graph exactly when the corresponding intervals have a nonempty intersection. An efficient algorithm for testing isomorphism of interval graphs is implemented using a data structure called a PQ-tree. The algorithm runs in 0(n + e) steps for graphs having n vertices and e edges. It is shown that for a somewhat larger class of graphs, namely the chordal graphs, isomorphism is as hard as for general graphs.

Kellogg S. Booth | George S. Lueker | G. S. Lueker | K. Booth

[1] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[2] John E. Hopcroft,et al. Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[4] Kellogg S. Booth. PQ-tree algorithms. , 1975 .

[5] Robert E. Tarjan,et al. Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[6] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .

[7] George Schick Lueker. Efficient algorithms for chordal graphs and interval graphs. , 1975 .

[8] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[9] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .