Author:
Fukuda Kazuma,Nakamori Mario
Reference22 articles.
1. Agrawal, M. and Arvind, V. (1996). A note on decision versus search for graph automorphism. Information and Computation, 131: 179–189.
2. Akutsu, T. (1988). A polynomial time algorithm for subgraph isomorphism of tree-like graphs. IPSJ 90-AL-17–2.
3. Babai, L., Erdös, P., and Selkow, S. M. (1980). Random graph isomorphism. SIAM J. Comput., 9: 628–635.
4. Babai, L., Grigoryev, D. Y., and Mount, D. M. (1982). Isomorphism of graphs with bounded eigenvalue multiplicity. Proc. 14th Annual ACM Symp. Theory of Computing, pages 310–324.
5. Babai, L. and Luks, E. M. (1983). Canonical labeling of graphs. Proc. 14th Annual ACM Symp. on Theory of Computing, Boston, pages 171–183.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献