Calcul de cliques maximales dans les flots de liens - Sorbonne Université Access content directly
Conference Papers Year : 2015

Calcul de cliques maximales dans les flots de liens

Tiphaine Viard
Matthieu Latapy
Clémence Magnien

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.
Fichier principal
Vignette du fichier
cliques-algotel.pdf (115.38 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01147966 , version 1 (04-05-2015)
hal-01147966 , version 2 (03-08-2016)

Identifiers

  • HAL Id : hal-01147966 , version 2

Cite

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⟩
324 View
185 Download

Share

Gmail Mastodon Facebook X LinkedIn More