The program finds and displays all cliques with different densities in a given bipartite graph with variable density.
-
Updated
Jan 19, 2015 - C++
The program finds and displays all cliques with different densities in a given bipartite graph with variable density.
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
Solver for finding sets of words with unique letters.
CHoleR: a C++ Tool for the Analysis of Persistent Homology on Undirected Weighted Graphs [C++, CLI/CLR, JNI, WPF, C#]
The code accompanies the paper "On Atomic Cliques in Temporal Graphs".
Classification of combinatorial objects
Add a description, image, and links to the cliques topic page so that developers can more easily learn about it.
To associate your repository with the cliques topic, visit your repo's landing page and select "manage topics."