Computing maximal cliques in link streams

Calcul de cliques maximales dans les flots de liens

Tiphaine Viard (1) , Matthieu Latapy (1) , Clémence Magnien (1)

1 ComplexNetworks

A link stream is a sequence 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 $\Delta$, a $\Delta$-clique is a set of nodes and a time interval such that all pairs of nodes in this set interact at least every $\Delta$ during this time interval. We propose an algorithm to enumerate all maximal cliques of a link stream, and illustrate its practical relevance on a real-world contact trace.

Mots clés: cliques; temporal networks; link streams; graphs; algorithms; time-varying graphs

Domaines: Algorithme et structure de données [cs.DS]; Autre [cs.OH]

Tiphaine Viard, Matthieu Latapy, Clémence Magnien. Computing maximal cliques in link streams. Theoretical Computer Science, 2015, ⟨10.1016/j.tcs.2015.09.030⟩. ⟨hal-01112627v4⟩