Efficient Algorithms for Spanning Tree Centrality

    IJCAI, pp. 3733-3739, 2016.

    Cited by: 7|Bibtex|Views1|Links
    EI

    Abstract:

    In a connected graph, spanning tree centralities of a vertex and an edge measure how crucial they are for the graph to be connected. In this paper, we propose efficient algorithms for estimating spanning tree centralities with theoretical guarantees on their accuracy. We experimentally demonstrate that our methods are orders of magnitude ...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments