Search Results for author:
Found 5 papers, 3 papers with code
LSCPM: communities in massive real-world Link Streams by Clique Percolation Method
We present a novel algorithm that adapts CPM to link streams, which has the advantage that it allows us to speed up the computation time with respect to the existing DCPM method.
Faster maximal clique enumeration in large real-world link streams
We take this idea as a starting point to propose a new algorithm which matches the cliques of the instantaneous graphs formed by links existing at a given time $t$ to the maximal cliques of the link stream.
Clique percolation method: memory efficient almost exact communities
Automatic detection of relevant groups of nodes in large real-world graphs, i. e. community detection, has applications in many fields and has received a lot of attention in the last twenty years.
Computing Betweenness Centrality in Link Streams
Betweeness centrality is one of the most important concepts in graph analysis.
Stream Graphs and Link Streams for the Modeling of Interactions over Time
It is also consistent with graph theory: graph concepts are special cases of the ones we introduce.
