Picture for Clémence Magnien

Clémence Magnien

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs

Add code
May 07, 2024
Viaarxiv icon

LSCPM: communities in massive real-world Link Streams by Clique Percolation Method

Add code
Aug 21, 2023
Viaarxiv icon

Faster maximal clique enumeration in large real-world link streams

Add code
Feb 01, 2023
Viaarxiv icon

Clique percolation method: memory efficient almost exact communities

Add code
Oct 04, 2021
Figure 1 for Clique percolation method: memory efficient almost exact communities
Figure 2 for Clique percolation method: memory efficient almost exact communities
Figure 3 for Clique percolation method: memory efficient almost exact communities
Figure 4 for Clique percolation method: memory efficient almost exact communities
Viaarxiv icon

Computing Betweenness Centrality in Link Streams

Add code
Feb 12, 2021
Figure 1 for Computing Betweenness Centrality in Link Streams
Figure 2 for Computing Betweenness Centrality in Link Streams
Figure 3 for Computing Betweenness Centrality in Link Streams
Figure 4 for Computing Betweenness Centrality in Link Streams
Viaarxiv icon

Stream Graphs and Link Streams for the Modeling of Interactions over Time

Add code
Oct 11, 2017
Figure 1 for Stream Graphs and Link Streams for the Modeling of Interactions over Time
Figure 2 for Stream Graphs and Link Streams for the Modeling of Interactions over Time
Figure 3 for Stream Graphs and Link Streams for the Modeling of Interactions over Time
Figure 4 for Stream Graphs and Link Streams for the Modeling of Interactions over Time
Viaarxiv icon