Computing maximal cliques in link streams

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… (More)
DOI: 10.1016/j.tcs.2015.09.030

Topics

6 Figures and Tables

Statistics

0100200201520162017
Citations per Year

Citation Velocity: 44

Averaging 44 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Viard2016ComputingMC, title={Computing maximal cliques in link streams}, author={Tiphaine Viard and Matthieu Latapy and Cl{\'e}mence Magnien}, journal={Theor. Comput. Sci.}, year={2016}, volume={609}, pages={245-252} }