Computing maximal cliques in link streams - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2016

Computing maximal cliques in link streams

Calcul de cliques maximales dans les flots de liens

Tiphaine Viard
Matthieu Latapy
Clémence Magnien

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

Dates and versions

hal-01112627 , version 1 (03-02-2015)
hal-01112627 , version 2 (07-02-2015)
hal-01112627 , version 3 (29-04-2015)
hal-01112627 , version 4 (30-09-2015)
hal-01112627 , version 5 (08-07-2016)

Identifiers

Cite

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

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More