38 citations · 248 across the 24 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 1 cited
Random graph matching at Otter's threshold via counting chandeliers
Cheng Mao, Yihong Wu, Jiaming Xu +1
We propose an efficient algorithm for graph matching based on similarity scores constructed from counting a certain family of weighted trees rooted at each vertex. For two Erdős-Ré…
math.ST2022★ 6 cited
Random Graph Matching in Geometric Models: the Case of Complete Graphs
Haoyu Wang, Yihong Wu, Jiaming Xu +1
This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching…