Efficient Densest Subgraph Computation in Evolving Graphs

    WWW, pp. 300-310, 2015.

    Cited by: 47|Bibtex|Views2|Links
    EI

    Abstract:

    Densest subgraph computation has emerged as an important primitive in a wide range of data analysis tasks such as community and event detection. Social media such as Facebook and Twitter are highly dynamic with new friendship links and tweets being generated incessantly, calling for efficient algorithms that can handle very large and high...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments