The K-clique Densest Subgraph Problem

    WWW, pp. 1122-1132, 2015.

    Cited by: 65|Bibtex|Views3|Links
    EI

    Abstract:

    Numerous graph mining applications rely on detecting subgraphs which are large near-cliques. Since formulations that are geared towards finding large near-cliques are hard and frequently inapproximable due to connections with the Maximum Clique problem, the poly-time solvable densest subgraph problem which maximizes the average degree ove...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments