graph-theoretic framework for robust pairwise data association
A reinforcement learning based solver for combinatorial problems
Implementation of branch and bound algorithm for maximum clique problem
ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.
Genetic Algorithm for the Maximum Clique Problem
Parallel Quantum Annealing
Implementation of branch and bound algorithm for maximum clique problem with cplex
A solver for the maximum(-weight) independent set and the maximum(-weight) clique problems
Graph theory experiments for the maximum clique problem using python.
Graph decomposition algorithms for MaxClique and Minimum Vertex Cover problems
Randomized Heuristic for the Maximum Clique Problem
This project solves the Maximum Clique Problem using continuous optimization algorithms like Projected Gradient Descent and Frank-Wolfe, implemented in a Jupyter Notebook.
Custom unembedding techniques for quantum annealers
A parallel, ant-based algorithm for the Maximum Clique problem.
This repository contains the code for the lab session of the course Graph Theory.
C++ MaxClique for Operations Research course
This project contains solutions for solving the max clique problem.
C++ implementation for finding maximum clique in an undirected graph using greedy method Bron–Kerbosch algorithm.
Add a description, image, and links to the maximum-clique topic page so that developers can more easily learn about it.
To associate your repository with the maximum-clique topic, visit your repo's landing page and select "manage topics."
