An efficient exact algorithm for triangle listing in large graphs

    Data Min. Knowl. Discov., Volume 30, Issue 5, 2016, Pages 1350-1369.

    Cited by: 6|Bibtex|Views10|Links
    EI
    Keywords:
    Triangle listingLarge graphsGraph compression

    Abstract:

    This paper presents a new efficient exact algorithm for listing triangles in a large graph. While the problem of listing triangles in a graph has been considered before, dealing with large graphs continues to be a challenge. Although previous research has attempted to tackle the challenge, this is the first contribution that addresses thi...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments