Fast probabilistic algorithms for hamiltonian circuits and matchings

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Dana Angluin
Leslie G. Valiant
Published in:
· Proceeding
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Pages 30-41
ACM New York, NY, USA ©1977
table of contents doi>10.1145/800105.803393
Fast probabilistic algorithms for hamiltonian circuits and matchings Published by ACM 1977 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 50
· Downloads (cumulative): 822
· Citation Count: 17


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