Sign in
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs.
Bintao Sun
Maximilien Danisch
T.-H. Hubert Chan
Mauro Sozio
Published in:
Proc. VLDB Endow. (2020)
Keyphrases
</>
maximum clique
dynamic programming
detection algorithm
dense subgraphs
np hard
computational complexity
objective function
data structure
probabilistic model
expectation maximization
optimal solution
subgraph mining
graph structure
graph mining
fully connected
maximum weight
graph isomorphism
clustering algorithm