A new algorithm samples a nearly uniform spanning tree of an n-vertex graph in about n^0.657 rounds of the Congested Clique model, the first sublinear-time result for this problem.
Parallel algorithms for geometric graph problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Sublinear-Time Sampling of Spanning Trees in the Congested Clique
A new algorithm samples a nearly uniform spanning tree of an n-vertex graph in about n^0.657 rounds of the Congested Clique model, the first sublinear-time result for this problem.