SIGN IN
SIGN UP
Overlapping clusters for distributed computation
Full Text:
PDF
Buy this Article
see
source materials
below for
more options
Authors:
Reid Andersen
Microsoft Corporation, Redmond, WA, USA
David F. Gleich
Purdue University, West Lafayette, IN, USA
Vahab Mirrokni
Google Research, New York, NY, USA
Published in:
· Proceeding
WSDM '12
Proceedings of the fifth ACM international conference on Web search and data mining
Pages 273-282
ACM
New York, NY
, USA
©2012
table of contents
ISBN: 978-1-4503-0747-5
doi>
10.1145/2124295.2124330
2012 Article
Bibliometrics
· Downloads (6 Weeks): 13
· Downloads (12 Months): 319
· Downloads (cumulative): 401
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
WSDM 2014
Share:
|
Tags:
algorithms
clustering
conductance
covering
diffusion
leave-time
network problems
pagerank
performance
theory
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