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#]

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.

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

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

metaheuristic

Implementation of branch and cut algorithm for maximum clique problem

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

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.

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.

Compute n-sized cliques of words!

This repository contains a C++ implementation of an exact algorithm to find the densest subgraph based on h-clique densities in an undirected graph. It supports any h ≥ 2 and is tested on standard datasets like AS733 and Netscience.

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

An algorithm for solving the max clique problem

This repository implements three maximal clique enumeration algorithms from notable research papers. Optimized for sparse and dense graphs, it includes C/C++ code with sample datasets for benchmarking and runtime analysis.

Graph builder for Ripple consensus simulator