Computing maximal cliques in link streams.
Theoretical Computer Science（2016）
摘要
•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.
更多查看译文
关键词
Link streams,Temporal networks,Time-varying graphs,Cliques,Graphs,Algorithms
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要