Computing maximal cliques in link streams
详细信息 查看全文
- 作者：Jordan Viard ; jordan.viard@lip6.fr" class="auth_mail" title="E-mail the corresponding author ; Matthieu Latapy ; Clé ; mence Magnien
- 关键词：Link streams ; Temporal networks ; Time-varying graphs ; Cliques ; Graphs ; Algorithms
- 刊名：Theoretical Computer Science
- 出版年：2016
- 出版时间：4 January 2016
- 年：2016
- 卷：609
- 期：part_P1
- 页码：245-252
- 全文大小：499 K
文摘
- •
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 f0010" class="interref" data-locatorType="url" data-locatorKey="http://www.github.com/JordanV/delta-cliques">http://www.github.com/JordanV/delta-cliques.