Expander flows, geometric embeddings and graph partitioning

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Sanjeev Arora Princeton University, Princeton, NJ
Satish Rao UC Berkeley
Umesh Vazirani UC Berkeley
Published in:
· Proceeding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Pages 222-231
ACM New York, NY, USA ©2004
table of contents ISBN:1-58113-852-0 doi>10.1145/1007352.1007355
Expander flows, geometric embeddings and graph partitioning Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 13
· Downloads (12 Months): 88
· Downloads (cumulative): 1,037
· Citation Count: 114


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