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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Babai, D.Y. Grigor'ev and D.M. Mount, Isomorphism of graphs with bounded eigenvalue multiplicity, in “Proc. 14th ACM STOC” (1982), 310–324
L. Babel, I.N. Ponomarenko, G. Tinhofer, The isomorphism problem for directed path graphs and for rooted directed path graphs, Report No. TUM-M9401, Institute of Mathematics, Technical University of Munich (1994), submitted
K.S. Booth and C.J. Colbourn, Problems polynomially equivalent to graph isomorphism, Report No. CS-77-04, Computer Science Department, University of Waterloo (1979)
K.S. Booth and G.S. Lueker, A linear-time algorithm for deciding interval graph isomorphism, J. of ACM 26 (1979), 183–195
D.G. Corneil, H. Lerchs and L. Stewart Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981), 163–174
G.J. Colbourn, On testing isomorphism of permutation graphs, Networks 11 (1981), 13–21
I.S. Filotti and J.N. Mayer, A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus, in “Proc. 12th ACM Symposium on Theory of Computing”, 1980, 235–243
M. Fontet, A linear algorithm for testing isomorphism of planar graphs, in “Proc. 3rd Colloquium on Automata, Languages and Programming”, 1976, 411–423
F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combinat. Theory B16 (1974), 47–56
F. Gavril, A recognition algorithm for the intersection graphs of directed paths in directed trees, Discrete Math. 13 (1975), 237–249
M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980
J.E. Hopcroft and J.K. Wong, Linear-time algorithm for isomorphism of planar graphs, in “Proc. 6th ACM Symp. Theory of Computing”, 1974, 172–184
R. Jamison and S. Olariu, On a unique tree representation for P 4-extendible graphs, Discrete Applied Mathematics 34 (1991), 151–164
R. Jamison and S. Olariu, A unique tree representation for P 4-sparse graphs, Discrete Applied Mathematics, 35 (1992), 115–129
D.S. Johnson, The NP-completeness column: an ongoing guide, Journal of Algorithms 6 (1985), 434–451
M.M. Klawe, M.M. Cornell and A. Proskurowski, Isomorphism testing in hook-up graphs, SIAM J. of Algebraic and Discrete Methods 3 (1982), 260–274
E.L. Lawler, Graphical algorithms and their complexity, Math. Centre Tracts 81 (1976), 3–32
E.M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, J. Comput. Syst. Sci. 25 (1982), 42–65
G.L. Miller, Isomorphism testing for graphs of bounded genus, in “Proc. 12th ACM Symposium on Theory of Computing”, 1980, 225–235
C.L. Monma and V.K. Wei, Intersection graphs of paths in a tree, Journal of Combinatorial Theory B41 (1986), 141–181
I.N. Ponomarenko, On the isomorphism problem for classes of graphs closed under contractions, in: “Zapiski Nauchnykh Seminarov LOMI”, 174 (1988), 147–177 (Russian)
H. Schreck and G. Tinhofer, A note on certain subpolytopes of the assignment polytope associated with circulant graphs, Linear Algebra and Its Applications 111 (1988), 125–134
G. Tinhofer, Graph isomorphism and theorems of Birkhoff type, Computing 36 (1986), 285–300
G. Tinhofer, Strong tree-cographs are Birkhoff graphs, Discrete Applied Mathematics 22 (1988/89), 275–288
G. Tinhofer, A note on compact graphs, Discrete Applied Mathematics 30 (1991), 253–264
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Babel, L., Ponomarenko, I., Tinhofer, G. (1995). Directed path graph isomorphism. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1994. Lecture Notes in Computer Science, vol 903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59071-4_64
Download citation
DOI: https://doi.org/10.1007/3-540-59071-4_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59071-2
Online ISBN: 978-3-540-49183-5
eBook Packages: Springer Book Archive