1 paper
Nima Anari, Nathan Hu, Amin Saberi +1
We study the problem of sampling a uniformly random directed rooted spanning tree, also known as an arborescence, from a possibly weighted directed graph. Classically, this problem…