Email
Favorite
Favorited ×
Download
Embed
Private Content
Copy and paste this code into your blog or website Copy Customize Close
We have emailed the verification/download link to "".
Login to your email and click the link to download the file directly.

To request the link at a different email address, update it here. Close
Validation messages. Success message. Fail message.

Check your bulk/spam folders if you can't find our mail.

Tweet

Loading…

Flash Player 9 (or above) is needed to view presentations.
We have detected that you do not have it on your computer. To install it, go here.

Computing Local Statistics in Massive Graphs

by Carlos Castillo on Jul 09, 2008

1,924 views

Efficient Semi-Streaming Algorithms for Local Triangle Counting in Massive Graphs

Efficient Semi-Streaming Algorithms for Local Triangle Counting in Massive Graphs

Accessibility

View text version

Categories

Technology

Tags

Upload Details

Uploaded via SlideShare as Adobe PDF

Usage Rights

© All Rights Reserved

File a copyright complaint

1 Embed 1

http://www.slideshare.net

1

Statistics

Favorites: 0
Downloads: 17
Comments: 0
Embed Views: 1
Views on SlideShare: 1,923
Total Views: 1,924

Computing Local Statistics in Massive Graphs — Presentation Transcript

Computing Local Statistics on Massive Graphs L. Becchetti, P. Boldi, C. Castillo and A. Gionis Computation on Computing Local Statistics on Massive Graphs Massive Graphs Triangles and Clustering Coeﬃcient Luca Becchetti1 , Paolo Boldi3 , Carlos Castillo2 and Estimating Triangle Counts Aristides Gionis2 Estimating set intersection Extensions 1. Universit` di Roma “La Sapienza” – Rome, Italy a Applications 2. Yahoo! Research – Barcelona, Spain and Santiago, Chile 3. University of Milano – Milano, Italy