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

Journal of Algorithms

Volumn 21, Issue 3, 1996, Pages 542-564

  Babel, L ^a   Ponomarenko, I N ^b   Tinhofer, G ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005255830     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0058     Document Type: Article

References (27)

1. L. Babai, Moderately exponential bound for graph isomorphism, in "Fundamentals of Computation Theory, Proceedings Conference FCT 1981, Szeged" (F. Gecseg, Ed.), Lecture Notes in Computer Science 117, pp. 34-50, Springer-Verlag, New York, 1981.
2. L. Babai, D. Y. Grigor'ev, and D. M. Mount, Isomorphism of graphs with bounded eigenvalue multiplicity, in "Proceedings, 14th ACM STOC (1982)," pp. 310-324.
3. K. S. Booth and C. J. Colbourn, Problems polynomially equivalent to graph isomorphism, Report CS-77-04, Computer Science Department, University of Waterloo, 1979.
4. K. S. Booth and G. S. Lueker, A linear-time algorithm for deciding interval graph isomorphism, J. Assoc. Comput. Math. 26 (1979), 183-195.
5. D. G. Corneil, H. Lerchs, and L. Stewart Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981), 163-174.
6. G. J. Colbourn, On testing isomorphism of permutation graphs, Networks 11 (1981), 13-21.
7. P. Dietz, Intersection graph algorithms, Technical Report TR 84-628, Cornell University, Ithaca, New York, 1984.
8. M. Fontet, A linear algorithm for testing isomorphism of planar graphs, in "Proceedings 3rd Colloquium on Automata, Languages and Programming, 1976," pp. 411-423.
9. F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combinat. Theory B 16 (1974), 47-56.
10. F. Gavril, A recognition algorithm for the intersection graphs of directed paths in directed trees, Discrete Math. 13 (1975), 237-249.
11. M. C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs," Academic Press, New York, 1980.
12. J. E. Hopcroft and J. K. Wong, Linear-time algorithm for isomorphism of planar graphs, in "Proceedings 6th ACM Symposium on Theory of Computing, 1974," pp. 172-184.
13. 4-extendible graphs, Discrete Appl. Math. 34 (1991), 151-164.
14. 4-sparse graphs, Discrete Appl. Math. 35 (1992), 115-129.
15. D. S. Johnson, The NP-completeness column: An ongoing guide, J. Algorithms 6 (1985), 434-451.
16. M. M. Klawe, M. M. Corneil, and A. Proskurowski, Isomorphism testing in hook-up graphs, SIAM J. Algebraic Discrete Methods 3 (1982), 260-274.
17. E. L. Lawler, Graphical algorithms and their complexity, Math. Centre Tracts 81 (1976), 3-32.
18. E. M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, J. Comput. System. Sci. 25 (1982), 42-65.
19. G. L. Miller, Isomorphism testing for graphs of bounded genus, in "Proceedings 12th ACM Symposium on Theory of Computing, 1980, pp. 225-235.
20. G. L. Miller, Isomorphism of k-contractible graphs, a generalization of bounded valence and bounded genus, Inform. Control 56 (1983), 1-20.
21. C. L. Monma and V. K. Wei, Intersection graphs of paths in a tree, J. Combin. Theory B 41 (1986), 141-181.
22. I. N. Ponomarenko, On the isomorphism problem for classes of graphs closed under contractions, Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. 174 (1988), 147-177. [In Russian].
23. H. Schreck and G. Tinhofer, A note on certain subpolytopes of the assignment polytope associated with circulant graphs, Linear Algebra Appl. 111 (1988), 125-134.
24. G. Tinhofer, Graph isomorphism and theorems of Birkhoff type, Computing 36 (1986), 285-300.
25. G. Tinhofer, Strong tree-cographs are Birkhoff graphs, Discrete Appl. Math. 22 (1988/89), 275-288.
26. G. Tinhofer, A note on compact graphs, Discrete Appl. Math. 30 (1991), 253-264.
27. V. M. Zemlyachenko, N. M. Kornienko, and R. I. Tyshkevich, Graph isomorphism problem, "The Theory of Computational Complexity I," Notes of Sci. Sem. LOMI, Vol. 118, 1982. [In Russian].