Theoretical underpinnings for maximal clique enumeration on perturbed graphs

William Hendrix, Matthew C. Schmidt, Paul Breimyer, Nagiza F. Samatova. Theoretical underpinnings for maximal clique enumeration on perturbed graphs. Theoretical Computer Science, 411(26-28):2520-2536, 2010. [doi]

Authors

William Hendrix

This author has not been identified. Look up 'William Hendrix' in Google

Matthew C. Schmidt

This author has not been identified. Look up 'Matthew C. Schmidt' in Google

Paul Breimyer

This author has not been identified. Look up 'Paul Breimyer' in Google

Nagiza F. Samatova

This author has not been identified. Look up 'Nagiza F. Samatova' in Google