枚举具有持续时间的链接流中的最大团
Enumerating maximal cliques in link streams with durations
摘要：
链接流对随时间的交互进行建模，并且链接流中的团被定义为节点的集合和时间间隔，使得该集合中的所有节点对在该时间间隔期间永久地交互。这个概念是最近在交互是瞬时的情况下引入的。我们将其推广到持续时间的相互作用的情况下，并表明瞬时的情况下，实际上是一个特殊的情况下，持续时间。我们提出了一种算法来检测最大的集团，提高了我们以前的瞬时链接流，并在几种情况下的利益比最先进的算法表现更好。
英文摘要：
Link streams model interactions over time, and a clique in a link stream is defined as a set of nodes and a time interval such that all pairs of nodes in this set interact permanently during this time interval. This notion was introduced recently in the case where interactions are instantaneous. We generalize it to the case of interactions with durations and show that the instantaneous case actually is a particular case of the case with durations. We propose an algorithm to detect maximal cliques that improves our previous one for instantaneous link streams, and performs better than the state of the art algorithms in several cases of interest.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
