Vertex and Hyperedge Connectivity in Dynamic Graph Streams

    ACM SIGMOD Conference on Principles of DB Systems, pp. 241-247, 2015.

    Cited by: 40|Bibtex|Views26|Links
    EI

    Abstract:

    A growing body of work addresses the challenge of processing dynamic graph streams: a graph is defined by a sequence of edge insertions and deletions and the goal is to construct synopses and compute properties of the graph while using only limited memory. Linear sketches have proved to be a powerful technique in this model and can also b...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments