Computing maximal cliques in link streams
Data Structures and Algorithms
2016-07-05 v7
Abstract
A link stream is a collection of triplets 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.
Keywords
Cite
@article{arxiv.1502.00993,
title = {Computing maximal cliques in link streams},
author = {Tiphaine Viard and Matthieu Latapy and Clémence Magnien},
journal= {arXiv preprint arXiv:1502.00993},
year = {2016}
}