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. On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs. In Jian Pei, Lise Getoor, Ander de Keijzer, editors, Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data, Paris, France, June 28, 2009. pages 48-56, ACM, 2009. [doi]

Abstract

Abstract is missing.