Sciweavers

Share
TCS
2016

Computing maximal cliques in link streams

3 years 6 months ago
Computing maximal cliques in link streams
A link stream is a collection of triplets (t, u, v) indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to such link streams: for a given ∆, a ∆-clique is a set of nodes and a time interval such that all pairs of nodes in this set interact at least once during each sub-interval of duration ∆. We propose an algorithm to enumerate all maximal (in terms of nodes or time interval) cliques of a link stream, and illustrate its practical relevance on a real-world contact trace.
Jordan Viard, Matthieu Latapy, Clémence Mag
Added 10 Apr 2016
Updated 10 Apr 2016
Type Journal
Year 2016
Where TCS
Authors Jordan Viard, Matthieu Latapy, Clémence Magnien
Comments (0)
books