Bron–Kerbosch algorithm implementation for finding maximal cliques in an undirected graph with OpenGL visualization
-
Updated
Mar 31, 2017 - C++
#
bron-kerbosch-algorithm
Here are 6 public repositories matching this topic...
CHoleR: a C++ Tool for the Analysis of Persistent Homology on Undirected Weighted Graphs [C++, CLI/CLR, JNI, WPF, C#]
cpp
undirected-graphs
bron-kerbosch-algorithm
persistent-homology
clique-graph
graphtheory
graph-plot
weighted-graphs
mcb
cliques
minimumcyclebasis
mfcb
depina
amaldi
-
Updated
Jan 20, 2020 - C++
A faster algorithm for finding maximal cliques.
-
Updated
Sep 18, 2023 - C++
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
-
Updated
Sep 5, 2017 - C++
Mathematics algorithm library
-
Updated
Feb 12, 2018 - C++
Improve this page
Add a description, image, and links to the bron-kerbosch-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the bron-kerbosch-algorithm topic, visit your repo's landing page and select "manage topics."