A general framework for graph sparsification

Full Text: PDFPDF SIGN IN to get this Article
Authors: Wai Shing Fung University of Waterloo, Waterloo, ON, Canada
Ramesh Hariharan Strand Life Sciences, Bangalore, India
Nicholas J.A. Harvey University of Waterloo, Waterloo, ON, Canada
Debmalya Panigrahi Massachusetts Institute of Technology, Cambridge, MA, USA
A general framework for graph sparsification Published by ACM 2011 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 134
· Downloads (cumulative): 273
· Citation Count: 5

Published in:
Cover Image
 
· Proceeding
STOC '11 Proceedings of the 43rd annual ACM symposium on Theory of computing
Pages 71-80
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0691-1 doi>10.1145/1993636.1993647

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