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: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/59437 https://orcid.org/0000-0003-0536-0323 https://orcid.org/0000-0002-4257-4198 |