Tight bounds for the Min-Max boundary decomposition cost of weighted graphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: David Steurer MPI Informatik, Stuhlsatzenhausweg, Saarbrücken, Germany
Published in:
Cover Image
 
· Proceeding
SPAA '06 Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Pages 197 - 206
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-452-9 doi>10.1145/1148109.1148142
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 164
· Citation Count: 0


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