CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams


CoCoS is a distributed streaming algorithm for estimating global and local triangle counts in graph streams.
CoCoS processes and samples edges across multiple machines to reduce redundancy in computation and storage.
CoCoS has the following advantages:


CoCoS is described in the following paper:


The source code used in the paper is available. [Github Repository]


ArXiv34.5K421K Paper citation network SNAP, KDD Cup Link
Facebook64K817K Friendship network MPI SWS Link
Google876K4.32M Web graph SNAP Link
BerkStan675K6.65M Web graph SNAP Link
Youtube3.22M9.37M Friendship network Network Repository, MPI SWS Link
Flickr2.30M22.8MFriendship network KONECT, MPI-SWS Link
LiveJournal4.00M34.7MFriendship network SNAP, MPI-SWS Link
Orkut3.07M117MFriendship network SNAP and MPI-SWS Link
FriendSter65.6M1.81BFriendship network KONECT Link