The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

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]  Stephan Olariu,et al.  A tree representation for P4-sparse graphs , 1992, Discret. Appl. Math..

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

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

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

[5]  Paul Frederick Dietz.  Intersection graph algorithms , 1984 .

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

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

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

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

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

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

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

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

[14]  Gary L. Miller,et al.  Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus , 1983, Inf. Control..

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

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

[17]  László Babai,et al.  Moderately Exponential Bound for Graph Isomorphism , 1981, FCT.

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

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

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

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

[22]  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).