Login / Signup
On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs.
William Hendrix
Matthew C. Schmidt
Paul Breimyer
Nagiza F. Samatova
Published in:
KDD Workshop on Knowledge Discovery from Uncertain Data (2009)
Keyphrases
</>
perturbation theory
optimal solution
np hard
maximal cliques
spanning tree
minimum spanning tree