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]

@article{HendrixSBS10,
  title = {Theoretical underpinnings for maximal clique enumeration on perturbed graphs},
  author = {William Hendrix and Matthew C. Schmidt and Paul Breimyer and Nagiza F. Samatova},
  year = {2010},
  doi = {10.1016/j.tcs.2010.03.011},
  url = {http://dx.doi.org/10.1016/j.tcs.2010.03.011},
  tags = {graph-rewriting, C++, rewriting},
  researchr = {https://researchr.org/publication/HendrixSBS10},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {411},
  number = {26-28},
  pages = {2520-2536},
}