# Computing maximal cliques in link streams

1 ComplexNetworks
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Keywords :
Document type :
Journal articles
Domain :

Cited literature [14 references]

https://hal.archives-ouvertes.fr/hal-01112627
Contributor : Tiphaine Viard <>
Submitted on : Friday, July 8, 2016 - 3:00:49 PM
Last modification on : Thursday, June 3, 2021 - 4:18:10 PM

### File

dcliques-algorithm.pdf
Files produced by the author(s)

### Citation

Tiphaine Viard, Matthieu Latapy, Clémence Magnien. Computing maximal cliques in link streams. Theoretical Computer Science, Elsevier, 2016, 609 (Part 1), pp.245-252. ⟨10.1016/j.tcs.2015.09.030⟩. ⟨hal-01112627v5⟩

Record views