SIGN IN
SIGN UP
Local graph sparsification for scalable clustering
Full Text:
PDF
Buy this Article
Authors:
Venu Satuluri
The Ohio State University, Columbus, OH, USA
Srinivasan Parthasarathy
The Ohio State University, Columbus, OH, USA
Yiye Ruan
The Ohio State University, Columbus, OH, USA
Published in:
· Proceeding
SIGMOD '11
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Pages 721-732
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0661-4
doi>
10.1145/1989323.1989399
2011 Article
Bibliometrics
· Downloads (6 Weeks): 21
· Downloads (12 Months): 224
· Downloads (cumulative): 479
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
algorithms
graph algorithms
graph clustering
graph sparsification
minwise hashing
performance
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder