A faster algorithm for finding maximal cliques.
-
Updated
Sep 18, 2023 - C++
A faster algorithm for finding maximal cliques.
A java project that calculates the maximal clique in Hamming graphs.
A simple genetic algorithm for the maximum clique problem based on feasibility maintenance.
Julia and Python complex system applications in ecology, epidemiology, sociology, economics & finance; network science models including Bianconi-Barabási, Barabási-Albert, Watts-Strogatz, Waxman Model & Erdős-Rényi; graph theory algorithms involving Gillespie, Bron Kerbosch, Ramsey, Bellman Ford, A*, Kruskal, Borůvka, Prim, Dijkstra, DSatur, Ran…
University algorithm-oriented project that accurately detects complex networks of influential mafia families represented as vertices and edges of rare graphs. The algorithms are being reduced to the Satisfiability Problem using a boolean formula that will be evaluated by an SAT Solver, deciding whether the initial clause has been satisfied or not.
Implementation of a state-of-the-art distributed algorithm for finding the maximal cliques in a graph
Implementation of branch and cut algorithm for maximum clique problem
C++ MaxClique for Operations Research course
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
Bron–Kerbosch algorithm implementation for finding maximal cliques in an undirected graph with OpenGL visualization
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."