Direct Path Graph Isomorphism (Extended Abstract)

This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path graphs is isomorphism complete, whereas for rooted directed path graphs we present a polynomial-time isomorphism algorithm.

[1]  Gottfried Tinhofer,et al.  A note on compact graphs , 1991, Discret. Appl. Math..

[2]  David M. Mount,et al.  Isomorphism of graphs with bounded eigenvalue multiplicity , 1982, STOC '82.

[3]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

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

[5]  Gottfried Tinhofer,et al.  Strong tree-cographs are birkhoff graphs , 1989, Discret. Appl. Math..

[6]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[7]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[8]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[9]  Max Fontet.  A Linear Algorithm for Testing Isomorphism of Planar Graphs , 1976, ICALP.

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

[11]  S. Olariu,et al.  On a unique tree representation for P4-extendible graphs , 1991, Discret. Appl. Math..

[12]  D. Corneil,et al.  Isomorphism Testing in Hookup Classes , 1982 .

[13]  Fanica Gavril,et al.  A recognition algorithm for the intersection graphs of directed paths in directed trees , 1975, Discret. Math..

[14]  G. Tinhofer,et al.  A note on certain subpolytopes of the assignment polytope associated with circulant graphs , 1988 .

[15]  Stephan Olariu,et al.  A tree representation for P4-sparse graphs , 1992, Discret. Appl. Math..

[16]  Kellogg S. Booth,et al.  A Linear Time Algorithm for Deciding Interval Graph Isomorphism , 1979, JACM.

[17]  Charles J. Colbourn,et al.  On testing isomorphism of permutation graphs , 1981, Networks.

[18]  I. Ponomarenko.  The isomorphism problem for classes of graphs closed under contraction , 1991 .

[19]  Clyde L. Monma,et al.  Intersection graphs of paths in a tree , 1986, J. Comb. Theory, Ser. B.

[20]  I. S. Filotti,et al.  A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus , 1980, STOC '80.

[21]  Gary L. Miller,et al.  Isomorphism testing for graphs of bounded genus , 1980, STOC '80.