Bron–Kerbosch algorithm implementation for finding maximal cliques in an undirected graph with OpenGL visualization
-
Updated
Mar 31, 2017 - C++
Bron–Kerbosch algorithm implementation for finding maximal cliques in an undirected graph with OpenGL visualization
A faster algorithm for finding maximal cliques.
C++ MaxClique for Operations Research course
Implementation of branch and cut algorithm for maximum clique problem
Implementation of Bron-Kerbosch algorithm to find maximal cliques in an undirected graph of a particular case at the Graph Theory and Application course @ University of Brasilia
Add a description, image, and links to the maximal-cliques topic page so that developers can more easily learn about it.
To associate your repository with the maximal-cliques topic, visit your repo's landing page and select "manage topics."