The GAP package Digraphs

Classification of combinatorial objects

Solver for finding sets of words with unique letters.

An R package for network vulnerability and influence analysis

Finds all k-cliques in a k-partite graph

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

A MATLAB interface to the C program Cliquer: quickly find cliques in graphs.

The code accompanies the paper "On Atomic Cliques in Temporal Graphs".

The program finds and displays all cliques with different densities in a given bipartite graph with variable density.

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

Testdata for Random Theoretical Experiement 3

graph representation of word embeddings

Basic Clique-finding algorithms

Nextflow workflow to call TAD cliques

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

Solving the winner determination problem via a weighted maximum clique heuristic using java

Some interesting algorithms regarding Graph Theory with sufficient explanation.