# Efficient random graph matching via degree profiles

19 Nov 2018Jian DingZongming MaYihong WuJiaming Xu

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $G(n,\frac{d}{n})$. This can be viewed as an average-case and noisy version of the graph isomorphism problem... (read more)

PDF Abstract

No code implementations yet. Submit your code now