35 citations · 65 across the 5 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LG2017★ 3 cited
A Streaming Algorithm for Graph Clustering
Alexandre Hollocou, Julien Maudet, Thomas Bonald +1
We introduce a novel algorithm to perform graph clustering in the edge streaming setting. In this model, the graph is presented as a sequence of edges that can be processed strictl…
cs.SI2017★ 22 cited
A linear streaming algorithm for community detection in very large networks
Alexandre Hollocou, Julien Maudet, Thomas Bonald +1
In this paper, we introduce a novel community detection algorithm in graphs, called SCoDA (Streaming Community Detection Algorithm), based on an edge streaming setting. This algori…