Author:
Fan Zhou,Mao Cheng,Wu Yihong,Xu Jiaming
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Analysis
Reference21 articles.
1. Y. Aflalo, A. Bronstein, and R. Kimmel. On convex relaxation of graph isomorphism. Proceedings of the National Academy of Sciences, 112(10):2942–2947, 2015.
2. B. Barak, C.-N. Chou, Z. Lei, T. Schramm, and Y. Sheng. (Nearly) efficient algorithms for the graph matching problem on correlated random graphs. arXiv preprintarXiv:1805.02349, 2018.
3. B. Barak, S. B. Hopkins, J. A. Kelner, P. Kothari, A. Moitra, and A. Potechin. A Nearly tight sum-of-squares lower bound for the planted clique problem. In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS, pp 428–437, 2016.
4. P. Biane. On the free convolution with a semi-circular distribution. Indiana University Mathematics Journal, 46(3):705–718, 1997.
5. R. E. Burkard, E. Cela, P. M. Pardalos, and L. S. Pitsoulis. The quadratic assignment problem. In Handbook of combinatorial optimization, vol. 3 (D.-Z. Du, P.M. Pardalos, eds.). Kluwer Academic Publishers, 1998, pp. 241–337.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献