Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Guy E. Blelloch Carnegie Mellon University, Pittsburgh, PA, USA
Anupam Gupta Carnegie Mellon University, Pittsburgh, PA, USA
Ioannis Koutis University of Puerto Rico, Rio Piedras, PR, USA
Gary L. Miller Carnegie Mellon University, Pittsburgh, PA, USA
Richard Peng Carnegie Mellon University, Pittsburgh, PA, USA
Kanat Tangwongsan Carnegie Mellon University, Pittsburgh, PA, USA
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs Published by ACM 2011 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 46
· Downloads (cumulative): 121
· Citation Count: 2

Published in:
Cover Image
 
· Proceeding
SPAA '11 Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures
Pages 13-22
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0743-7 doi>10.1145/1989493.1989496

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