A MATLAB interface to the C program Cliquer: quickly find cliques in graphs.
-
Updated
May 16, 2018 - C
A MATLAB interface to the C program Cliquer: quickly find cliques in graphs.
Solver for finding sets of words with unique letters.
This repository gathers the material of my course conclusion work (TCC) at Unisinos - theme of the work: Quantum Computing - Analysis of Quantum Algorithms for Solving the SAT Problem in the NISQ Era
The program finds and displays all cliques with different densities in a given bipartite graph with variable density.
This is part of "COMP546: Algorithms Design and Analysis" Course in Koc University. The project was developing an algorithm to achieve dataset reduction by Clustering 3D structures of protein-protein interaction interfaces
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.
Calcul de cliques maximales dans un graphe
Implementation of DDA algorithm for finding maximal degree-based quasi-cliques using Gonum graph representation.
Add a description, image, and links to the clique-detection topic page so that developers can more easily learn about it.
To associate your repository with the clique-detection topic, visit your repo's landing page and select "manage topics."