research
∙
08/21/2023
LSCPM: communities in massive real-world Link Streams by Clique Percolation Method
Community detection is a popular approach to understand the organization...
share
research
∙
05/01/2023
Temporal Betweenness Centrality on Shortest Paths Variants
Betweenness centrality has been extensively studied since its introducti...
research
∙
04/19/2023
Temporal Betweenness Centrality on Shortest Paths
Betweenness centrality measure assesses the importance of nodes in a gra...
research
∙
02/01/2023
Faster maximal clique enumeration in large real-world link streams
Link streams offer a good model for representing interactions over time....
research
∙
03/09/2022
Tailored vertex ordering for faster triangle listing in large graphs
Listing triangles is a fundamental graph problem with many applications,...
research
∙
10/04/2021
Clique percolation method: memory efficient almost exact communities
Automatic detection of relevant groups of nodes in large real-world grap...
research
∙
07/05/2021
Ranking Online Social Users by their Influence
We introduce an original mathematical model to analyse the diffusion of ...
research
∙
02/12/2021
Computing Betweenness Centrality in Link Streams
Betweeness centrality is one of the most important concepts in graph ana...
research
∙
11/16/2020
Strongly Connected Components in Stream Graphs: Computation and Experimentations
Stream graphs model highly dynamic networks in which nodes and/or links ...
research
∙
06/11/2019
Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks
We recently introduced a formalism for the modeling of temporal networks...
research
∙
12/19/2017
Enumerating maximal cliques in link streams with durations
Link streams model interactions over time, and a clique in a link stream...
research
∙
10/11/2017
