186 citations · 357 across the 28 of their papers we have counts for
30 papers
LSCPM: communities in massive real-world Link Streams by Clique Percolation Method
Alexis Baudin, Lionel Tabourier, Clémence Magnien
Community detection is a popular approach to understand the organization of interactions in static networks. For that purpose, the Clique Percolation Method (CPM), which involves t…
Temporal Betweenness Centrality on Shortest Paths
Mehdi Naima, Matthieu Latapy, Clémence Magnien
Betweenness centrality measure assesses the importance of nodes in a graph and has been used in a variety of contexts. Betweenness centrality has also been extended to temporal gra…
Faster maximal clique enumeration in large real-world link streams
Alexis Baudin, Clémence Magnien, Lionel Tabourier
Link streams offer a good model for representing interactions over time. They consist of links , where and are vertices interacting during the whole time interva…
Tailored vertex ordering for faster triangle listing in large graphs
Fabrice Lécuyer, Louis Jachiet, Clémence Magnien +1
Listing triangles is a fundamental graph problem with many applications, and large graphs require fast algorithms. Vertex ordering allows the orientation of edges from lower to hig…
Clique percolation method: memory efficient almost exact communities
Alexis Baudin, Maximilien Danisch, Sergey Kirgizov +2
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 las…
Ranking Online Social Users by their Influence
Anastasios Giovanidis, Bruno Baynat, Clémence Magnien +1
We introduce an original mathematical model to analyse the diffusion of posts within a generic online social platform. The main novelty is that each user is not simply considered a…