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

@article{Bannister2013WindowsIR,
  title={Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges},
  author={Michael J. Bannister and Christopher DuBois and David Eppstein and Padhraic Smyth},
  journal={ArXiv},
  year={2013},
  volume={abs/1209.5791}
}
  • Michael J. Bannister, Christopher DuBois, +1 author Padhraic Smyth
  • Published in SODA 2013
  • Computer Science, Mathematics
  • 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-6 OF 6 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES

    The h-Index of a Graph and its Application to Dynamic Subgraph Statistics

    VIEW 3 EXCERPTS

    Lower bounds for 2-dimensional range counting

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    A Survey of Statistical Network Models

    VIEW 1 EXCERPT

    Networks Evolving Step by Step: Statistical Analysis of Dyadic Event Data

    VIEW 1 EXCERPT