1 paper
Mehrdad Moharrami, Cristopher Moore, Jiaming Xu
We study the problem of detecting and recovering a planted spanning tree Mn∗ hidden within a complete, randomly weighted graph Gn. Specifically, each edge e has a non-nega…