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…

Bron–Kerbosch algorithm implementation for finding maximal cliques in an undirected graph with OpenGL visualization

Implementation of a state-of-the-art distributed algorithm for finding the maximal cliques in a graph

A faster algorithm for finding maximal cliques.

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.

C++ MaxClique for Operations Research course

A simple genetic algorithm for the maximum clique problem based on feasibility maintenance.

A java project that calculates the maximal clique in Hamming graphs.

Implementation of branch and cut algorithm for maximum clique problem

C++ version of LonelyNodes

Maximal-Clique in a dynamic Graph

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