arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.5791cs.DS
收藏

关系事件的窗口:边的连续子序列的数据结构

Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges

Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth

摘要:

我们考虑分析社交网络数据集的问题,其中网络的边缘具有时间戳,并且我们希望分析这些时间戳的连续子区间中的边缘形成的子图。我们为这些问题提供了数据结构,这些问题使用近线性的预处理时间、线性空间和亚对数查询时间来处理查询,这些查询要求连接组件的数量、包含循环的组件的数量、度等于或至多为某个预定值的顶点的数量、可以通过时间增加路径从顶点的起始集合到达的顶点的数量以及相关查询。

英文摘要:

We consider the problem of analyzing social network data sets in which the edges of the network have timestamps, and we wish to analyze the subgraphs formed from edges in contiguous subintervals of these timestamps. We provide data structures for these problems that use near-linear preprocessing time, linear space, and sublogarithmic query time to handle queries that ask for the number of connected components, number of components that contain cycles, number of vertices whose degree equals or is at most some predetermined value, number of vertices that can be reached from a starting set of vertices by time-increasing paths, and related queries.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑