Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges
Abstract
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 nearlinear 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 timeincreasing paths, and related queries.
 Publication:

arXiv eprints
 Pub Date:
 September 2012
 arXiv:
 arXiv:1209.5791
 Bibcode:
 2012arXiv1209.5791B
 Keywords:

 Computer Science  Data Structures and Algorithms