Author:
Arvind V.,Köbler Johannes,Rattan Gaurav,Verbitsky Oleg
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Arvind, V., Köbler, J., Rattan, G., Verbitsky, O.: Graph isomorphism, color refinement, and compactness. ECCC TR15-032 (2015)
2. Arvind, V., Köbler, J., Rattan, G., Verbitsky, O.: On the power of color refinement. In: Proceedings of the 20th International Symposium on Fundamentals of Computation Theory (FCT), Lecture Notes in Computer Science. Springer (2015, to appear)
3. Atserias, A., Maneva, E.N.: Sherali-Adams relaxations and indistinguishability in counting logics. SIAM J. Comput. 42(1), 112–137 (2013)
4. Babai, L., Erdös, P., Selkow, S.M.: Random graph isomorphism. SIAM J. Comput. 9(3), 628–635 (1980)
5. Brualdi, R.A.: Some applications of doubly stochastic matrices. Linear Algebra Appl. 107, 77–100 (1988)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献