Publisher
Springer International Publishing
Reference9 articles.
1. Arvind, V., Das, B., Köbler, J., Toda, S.: Colored hypergraph isomorphism is fixed parameter tractable. Algorithmica 71, 120–138 (2015)
2. Babai, L.: Monte carlo algorithms in graph isomorphism testing. Technical Report 79–10, Départment de mathématiques et de statistique, Université de Montréal, Montréal (1979)
3. Babai, L., Grigoryev, Yu, D., Mount, D.M.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, San Francisco, 5–7 May 1982, pp. 310–324. ACM, New York (1982)
4. Bannai, E., Bannai, E.: A survey on spherical designs and algebraic combinatorics on spheres. Eur. J. Combin. 30, 1392–1425 (2009)
5. Cambridge Mathematical Library;N Biggs,1993
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献