Computing maximal cliques in link streams

•We introduce delta-cliques, that generalize graph cliques to link streams/time-varying graphs.•We provide a greedy algorithm to compute all delta-cliques of a link stream.•Implementation available on http://www.github.com/TiphaineV/delta-cliques. A link stream is a collection of triplets (t,u,v) in...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 609; číslo Part 1; s. 245 - 252
Hlavní autoři: Viard, Tiphaine, Latapy, Matthieu, Magnien, Clémence
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 04.01.2016
Elsevier
Témata:
Algorithms
Cliques
Collection
Computation
Computer Science
Contact
Data Structures and Algorithms
Graphs
Intervals
Link streams
Links
Other
Streams
Temporal networks
Time-varying graphs
Link streams
Graphs
Algorithms
Cliques
Time-varying graphs
Temporal networks
algorithms
graphs
time-varying graphs
cliques
temporal networks
link streams
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•We introduce delta-cliques, that generalize graph cliques to link streams/time-varying graphs.•We provide a greedy algorithm to compute all delta-cliques of a link stream.•Implementation available on http://www.github.com/TiphaineV/delta-cliques. 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 to a real-world contact trace.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2015.09.030