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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.