Generating random spanning trees more quickly than the cover time

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: David Bruce Wilson Department of Mathematics, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts
Published in:
Cover Image
 
· Proceeding
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Pages 296-303
ACM New York, NY, USA ©1996
table of contents ISBN:0-89791-785-5 doi>10.1145/237814.237880
Generating random spanning trees more quickly than the cover time Published by ACM 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 58
· Downloads (cumulative): 831
· Citation Count: 19


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder