Efficient algorithms for large-scale local triangle counting

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Luca Becchetti “Sapienza” Università di Roma, Rome, Italy
Paolo Boldi Università degli Studi di Milano, Milan, Italy
Carlos Castillo Yahoo! Research, Spain, Barcelona Spain
Aristides Gionis Yahoo! Research, Spain, Barcelona Spain
Efficient algorithms for large-scale local triangle counting Published by ACM 2010 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 97
· Downloads (cumulative): 314
· Citation Count: 3

Published in:
Cover Image
 
· Journal
ACM Transactions on Knowledge Discovery from Data (TKDD) TKDD Homepage archive
Volume 4 Issue 3, October 2010
Article No. 13
ACM New York, NY, USA
table of contents doi>10.1145/1839490.1839494

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