Author:
Mao Cheng,Rudelson Mark,Tikhomirov Konstantin
Publisher
Springer Science and Business Media LLC
Subject
Statistics, Probability and Uncertainty,Statistics and Probability,Analysis
Reference28 articles.
1. Babai, L.: Graph isomorphism in quasipolynomial time. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 684–697 (2016)
2. Barak, B., Chou, C.-N., Lei, Z., Schramm, T., Sheng, Y.: (Nearly) efficient algorithms for the graph matching problem on correlated random graphs. In: Advances in Neural Information Processing Systems, pp. 9190–9198 (2019)
3. Burkard, R.E., Cela, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Handbook of Combinatorial Optimization, pp. 1713–1809. Springer (1998)
4. Babai, L., Erdös, P., Selkow, S.M.: Random graph isomorphism. SIAM J. Comput. 9(3), 628–635 (1980)
5. Bollobás, B.: Distinguishing vertices of random graphs. North-Holland Math. Stud. 62, 33–49 (1982)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献