Skip to content
#

maximal-cliques

Here are 13 public repositories matching this topic...

graph-theory

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…

  • Updated Apr 29, 2022
  • Jupyter Notebook

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.

  • Updated Mar 10, 2021
  • Java

Improve this page

Add a description, image, and links to the maximal-cliques topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the maximal-cliques topic, visit your repo's landing page and select "manage topics."

Learn more