Library of community detection algorithms and visualization tools
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
CHoleR: a C++ Tool for the Analysis of Persistent Homology on Undirected Weighted Graphs [C++, CLI/CLR, JNI, WPF, C#]
Find maximal clique of each input graph, plus a maximal common induced subgraph of all input graphs.
A faster algorithm for finding maximal cliques.
♟️ Trabalho Pratico 2 - Grafos
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
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
Mathematics algorithm library
Graph algorithms studied in the Graph Theory and Application class at Universidade de Brasília (UnB) in the first semester of 2021.
Projeto 1 de Teoria e Aplicação de Grafos (TAG), disciplina ofertada na Universidade de Brasília (UnB) no semestre 2021.1.
WPF application to work with graphs
Add a description, image, and links to the bron-kerbosch-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the bron-kerbosch-algorithm topic, visit your repo's landing page and select "manage topics."