Faster generation of random spanning trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1+ d) of uniform in expected time O[over-(m[sqrt]n log 1/d).This improves the sparse graph case of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers,
2010-10-20T20:36:07Z.
|
| Subjects: | |
| Online Access: | Get fulltext |