Clique Percolation Method to extract communities for a graph network. [R implementation]

Python3, NetworkX, Java, MLlib, Spark, Cassandra, Neo4j 3.0, Gephi, Docker

A simple SAT solver written in Java

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

Collection of Assignments and Programs For CS 146: Data Structures and Algorithms

metaheuristic

C implementation of finding Maximal and Maximum Clique Using Bron Kerbosch Algorithm

A collection of Python scripts to explore and visualize the B-Matrix of a graph network. Part of CPSC 547 (Information Visualization) 2022 at UBC.

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 three fundamental algorithms in graph theory and Boolean logic: Satisfiability (SAT), Clique, and Independent Set. Each problem is addressed using various optimization and search techniques.

An algorithm for solving the max clique problem

Graph builder for Ripple consensus simulator

Implementation of branch and cut algorithm for maximum clique problem

Este repositorio es una colección de algoritmos de grafos que abordan diversos problemas, incluyendo la detección de comunidades en redes, la búsqueda de la ruta más corta y la identificación de cubiertas de k-cliques.

QClique: Optimizing Performance and Accuracy in Maximum Weighted Clique

Repositório doProjeto Final de Análise de Algoritmos - 2024 - Natalia Almada e Matheus Melo - Problema do Clique