CHoleR: a C++ Tool for the Analysis of Persistent Homology on Undirected Weighted Graphs [C++, CLI/CLR, JNI, WPF, C#]

metaheuristic

C++ algorithm to solve(or try to solve) the clique problem

The program finds and displays all cliques with different densities in a given bipartite graph with variable density.

Implementation of branch and cut algorithm for maximum clique problem

An algorithm for solving the max clique problem

QClique: Optimizing Performance and Accuracy in Maximum Weighted Clique