Library of graph clustering algorithms

An experimental framework for building computational models and tracing their multithreaded evolution as 2D/3D graphs.

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

Bipartite Graph QM

A faster algorithm for finding maximal cliques.

Find maximal clique of each input graph, plus a maximal common induced subgraph of all input graphs.

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

Calculates maximals and maximum cliques of a graph.

Projeto 1 de Teoria e Aplicação de Grafos (TAG), disciplina ofertada na Universidade de Brasília (UnB) no semestre 2021.1.

Graph algorithms studied in the Graph Theory and Application class at Universidade de Brasília (UnB) in the first semester of 2021.

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

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.

Repositório de armazenamento de projetos da disciplina Teoria e Aplicação de Grafos realizada no semestre de 2022.2

Disciplina: Teoria e Aplicação de Grafos Aluno: Felipe Nascimento Rocha Matrícula: 170050084 Professor: Díbio Borges

♟️ Trabalho Pratico 2 - Grafos

🔒 RSA Implementation in Go + ILP in Python for COSC 581 (Algorithms)

WPF application to work with graphs

Detailed exploration of the Maximum Clique Problem, including NP-completeness, algorithmic approaches. Completed as part of the final project for Algorithm Analysis and Design course.

Mathematics algorithm library

Calcul de cliques maximales dans un graphe