Skip to Main content Skip to Navigation
Conference papers

Calcul de cliques maximales dans les flots de liens

Tiphaine Viard 1 Matthieu Latapy 1 Clémence Magnien 1
1 ComplexNetworks
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Tiphaine Viard <>
Submitted on : Wednesday, August 3, 2016 - 3:19:28 PM
Last modification on : Thursday, June 3, 2021 - 4:18:10 PM
Long-term archiving on: : Tuesday, November 8, 2016 - 6:38:18 PM


Files produced by the author(s)


  • HAL Id : hal-01147966, version 2


Tiphaine Viard, Matthieu Latapy, Clémence Magnien. Calcul de cliques maximales dans les flots de liens. 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2015), Jun 2015, Beaune, France. ⟨hal-01147966v2⟩



Record views


Files downloads