Bron–Kerbosch algorithm implementation for finding maximal cliques in an undirected graph with OpenGL visualization
-
Updated
Mar 31, 2017 - C++
#
maximal-cliques-finding
Here are 2 public repositories matching this topic...
This repository implements three maximal clique enumeration algorithms from notable research papers. Optimized for sparse and dense graphs, it includes C/C++ code with sample datasets for benchmarking and runtime analysis.
c cpp14 enumeration research-paper algorithms-implemented optimization-algorithms bron-kerbosch-algorithm algorithms-and-data-structures clique-graph maximal-cliques-finding dataset-analysis dense-graph
-
Updated
Mar 5, 2026 - HTML
Improve this page
Add a description, image, and links to the maximal-cliques-finding topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the maximal-cliques-finding topic, visit your repo's landing page and select "manage topics."