The GAP package Digraphs
-
Updated
Oct 28, 2026 - GAP
The GAP package Digraphs
Classification of combinatorial objects
The code accompanies the paper "On Atomic Cliques in Temporal Graphs".
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.
Fairness-Aware Clique-Preserving Spectral Clustering of Temporal Graphs, WWW 2023
An R package for network vulnerability and influence analysis
Solver for finding sets of words with unique letters.
graph representation of word embeddings
Nextflow workflow to call TAD cliques
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
Compute n-sized cliques of words!
This repository is devoted to the field of Graph Analysis and related topics.
Solving the winner determination problem via a weighted maximum clique heuristic using java
Some interesting algorithms regarding Graph Theory with sufficient explanation.
To associate your repository with the cliques topic, visit your repo's landing page and select "manage topics."