Computing automorphism groups of chordal graphs whose simplicial components are of small size

IEICE Transactions on Information and Systems

Volumn E89-D, Issue 8, 2006, Pages 2388-2401

  Toda, Seinosuke ^a  

^a NIHON UNIVERSITY   (Japan)

Author keywords

Algorithm; Automorphism; Chordal graph; Computational complexity; Computational group theory; Isomorphism; Simplicial component

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; INFORMATION THEORY; OPTIMIZATION; POLYNOMIALS;

AUTOMORPHISM; CHORDAL GRAPH; COMPUTATIONAL GROUP THEORY; ISOMORPHISM; SIMPLICIAL COMPONENTS;

GRAPH THEORY;

EID: 33747868361     PISSN: 09168532     EISSN: 17451361     Source Type: Journal    
DOI: 10.1093/ietisy/e89-d.8.2388     Document Type: Article

References (15)

1. L. Babai. "Monte Carlo algorithms in graph isomorphism testing." Technical Report 79-10, Dép. Math et Stat. Univ. de Montréal, 1979.
2. L. Babai. D. Y. Grigoryev. and D.M. Mount, "Isomorphism of graphs with bounded eigenvalue multiplicity," Proc. of the 14th Annual ACM Symposium on Theory of Computing, pp.310-324, 1982.
3. L. Babel, "Isomorphism of chordal (6.3) graphs," Computing, vol.54, pp.303-316. 1995.
4. L. Babel, I.N. Ponomarenko. and G. Tinhofer, "The isomorphism problems for directed path graphs and for rooted directed path graphs," J. Algorithms, vol.21, pp.542-564, 1996.
5. A. Brandst dt, V.B. Le. and J.P. Spinrad, "Graph classes: A survey," SIAM Monographs on Discrete Mathematics and Applications. SIAM. 1999.
6. M. Furst, J. Hopcroft. and E. Luks. "Polynomial-time algorithm for permutation groups." Proc. 21st Annual IEEE Symposium on Foundations of Computer Science, pp.36-41, 1980.
7. C.M. Hoffmann, "Group-theoretic algorithms and graph isomorphism." Lect. Notes Comput. Sci., vol.136, p.311. Springer, 1982.
8. M.M. Klawe. D.G. Cornell, and A. Proskurowski. "Isomorphism testing in hookup classes," SIAM J. Algebr. Discrete Methods, vol.3, no.2. pp.260-274, 1982.
9. G.S. Lueker and K.S. Booth, "A linear time algorithm for deciding interval graph isomorphism," J. ACM. vol.26, pp. 183-195. 1979.
10. E.M. Luks, "Isomorphism of graphs of bounded valence can be tested in polynomial time." J. Comput. Syst. Sci., vol.25, pp.42-65. 1982.
11. T. Nagoya, "Counting graph isomorphisms among chordal graphs with restricted clique number," IEICE Trans. Inf. & Syst., vol.E85-D. no.7, pp.1065-1073, July 2002.
12. A. Serress, Permutation Group Algorithms. Cambridge University Press, 2003.
13. J. Spinrad, Efficient Graph Representations, American Mathematical Society, p. 342, 2003.
14. R. Uehara. S. Toda. and T. Nagoya, "Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs," Discrete Appl. Math., vol. 145. pp.479-482, 2005.
15. R. Uehara and Y. Uno. "Laminar structure of ptolemaic graphs and its applications," Proc. 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), Lect. Notes Comput. Sci. vol.3827, pp. 186-195. Springer-Verlag. 2005.