Efficiently enumerating all maximal cliques with bit-parallelism

Pablo San Segundo, Jorge Artieda, Darren Strash. Efficiently enumerating all maximal cliques with bit-parallelism. Computers & OR, 92:37-46, 2018. [doi]

@article{SegundoAS18,
  title = {Efficiently enumerating all maximal cliques with bit-parallelism},
  author = {Pablo San Segundo and Jorge Artieda and Darren Strash},
  year = {2018},
  doi = {10.1016/j.cor.2017.12.006},
  url = {https://doi.org/10.1016/j.cor.2017.12.006},
  researchr = {https://researchr.org/publication/SegundoAS18},
  cites = {0},
  citedby = {0},
  journal = {Computers & OR},
  volume = {92},
  pages = {37-46},
}