38 citations · 248 across the 24 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Optimality of Random Regular Graphs in Sparse Network Designs
Weijia Li, Xiaochun Niu, Yehua Wei +1
The problems of designing sparse networks arise frequently in resource allocation and operations research. In production systems, for example, sparse process flexibility designs ar…
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é…