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.
Cite
CITATION STYLE
Babel, L., Ponomarenko, I., & Tinhofer, G. (1995). Directed path graph isomorphism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 903, pp. 395–406). Springer Verlag. https://doi.org/10.1007/3-540-59071-4_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
