Login / Signup
Theoretical underpinnings for maximal clique enumeration on perturbed graphs.
William Hendrix
Matthew C. Schmidt
Paul Breimyer
Nagiza F. Samatova
Published in:
Theor. Comput. Sci. (2010)
Keyphrases
</>
theoretical underpinnings
maximal clique enumeration
maximal cliques
graph theory
maximum clique
graph theoretic
machine learning
complex networks
graph structure
association graph
graph mining
directed graph
bipartite graph
weighted graph