Author:
Cai Jin-Yi,F�rer Martin,Immerman Neil
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference41 articles.
1. A. V. Aho, J. E. Hopcroft andJ. D. Ullman:The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).
2. M. Ajtai: Recursive Construction for 3-Regular Expanders,28th IEEE Symp. on Foundations of Computer Science (1987), 295?304.
3. L. Babai: Monte Carlo Algorithms in Graph Isomorphism Testing, Tech. Rep. DMS 79-10, Université de Montréal, 1979.
4. L. Babai: On the Complexity of Canonical Labeling of Strongly Regular Graphs,SIAM J. Computing 9 (1980), 212?216.
5. L. Babai: Moderately Exponential Bound for Graph Isomorphism,Proc. Conf. on Fundamentals of Computation Theory, Lecture Notes in Computer Science, Springer, 1981, 34?50.
Cited by
292 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献