GreedyBB

Clique enumeration (GreedyBB): This repository contains a release of GreedyBB , an algorithm for exhaustive clique enumeration (to appear in Computers & Operations Research). Source code for GreedyBB corresponds with the header file copt/clique/clique_enum.h

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 2 articles , 1 standard article )

Showing results 1 to 2 of 2.
Sorted by year (citations)

  1. Brito, Samuel Souza; Santos, Haroldo Gambini: Preprocessing and cutting planes with conflict graphs (2021)
  2. San Segundo, Pablo; Artieda, Jorge; Strash, Darren: Efficiently enumerating all maximal cliques with bit-parallelism (2018)