An efficient block model for clustering sparse graphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Ádám Gyenge Computer and Automation Research Institute, Hungarian Academy of Sciences
Janne Sinkkonen Xtract Ltd., Helsinki, Finland
András A. Benczúr Computer and Automation Research Institute, Hungarian Academy of Sciences
Published in:
· Proceeding
MLG '10 Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Pages 62-69
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-4503-0214-2 doi>10.1145/1830252.1830261
An efficient block model for clustering sparse graphs Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 41
· Downloads (cumulative): 184
· 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