40 citations · 63 across the 4 of their papers we have counts for
1 paper · 1 filter
Boaz Barak, Chi-Ning Chou, Zhixian Lei +2
We give a quasipolynomial time algorithm for the graph matching problem (also known as noisy or robust graph isomorphism) on correlated random graphs. Specifically, for every γ>0…