290 citations · 787 across the 47 of their papers we have counts for
8 papers · 1 filter
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…
Computing Betweenness Centrality in Link Streams
Frédéric Simard, Clémence Magnien, Matthieu Latapy
Betweeness centrality is one of the most important concepts in graph analysis. It was recently extended to link streams, a graph generalization where links arrive over time. Howeve…
Enumerating maximal cliques in link streams with durations
Tiphaine Viard, Clémence Magnien, Matthieu Latapy
Link streams model interactions over time, and a clique in a link stream is defined as a set of nodes and a time interval such that all pairs of nodes in this set interact permanen…
Discovering Patterns of Interest in IP Traffic Using Cliques in Bipartite Link Streams
Tiphaine Viard, Raphaël Fournier-S'niehotta, Clémence Magnien +1
Studying IP traffic is crucial for many applications. We focus here on the detection of (structurally and temporally) dense sequences of interactions, that may indicate botnets or…
Computing maximal cliques in link streams
Tiphaine Viard, Matthieu Latapy, Clémence Magnien
A link stream is a collection of triplets indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to…
Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs
Clemence Magnien, Matthieu Latapy, Michel Habib
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network ana…
Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs
Matthieu Latapy
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of the…
Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View
Pascal Pons, Matthieu Latapy
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori…