All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis

    Knowledge and Data Engineering, IEEE Transactions  , Volume PP, Issue 99, 2015, Pages 1

    Cited by: 64|Bibtex|Views50|Links
    EI WOS
    Keywords:
    estimationcloseness centrality

    Abstract:

    Graph datasets with billions of edges, such as social and Web graphs, are prevalent. To be feasible, computation on such large graphs should scale linearly with graph size. All-distances sketches (ADSs) are emerging as a powerful tool for scalable computation of some basic properties of individual nodes or the whole graph. ADSs were first...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments