Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling

    WWW, pp. 237-248, 2014.

    Cited by: 68|Bibtex|Views12|Links
    EI
    Keywords:
    distance querydynamic graph updatesanswer querydynamic indexing schemelarge time-evolving graphMore(7+)

    Abstract:

    We propose two dynamic indexing schemes for shortest-path and distance queries on large time-evolving graphs, which are useful in a wide range of important applications such as real-time network-aware search and network evolution analysis. To the best of our knowledge, these methods are the first practical exact indexing methods to effici...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments