Implementation of branch and bound algorithm for maximum clique problem
-
Updated
Dec 16, 2017 - Python
#
max-clique
Here are 12 public repositories matching this topic...
Different algorithms to find maximum clique in a graph.
-
Updated
Sep 5, 2021 - Python
Maximum Clique Problem solved by Branch and Bound method and Cplex Optimization.
-
Updated
Dec 3, 2021 - Python
-
Updated
Nov 21, 2021 - Python
Russian Doll Search for Computing Maximum Vertex Weight Hereditary Structures in Graphs. Now with OpenMP support.
-
Updated
Dec 30, 2024 - C++
draft of some research I was doing on Maximum Clique
-
Updated
Dec 28, 2024 - C++
A parallel, ant-based algorithm for the Maximum Clique problem.
-
Updated
Sep 3, 2023 - C++
Implementation of Branch-n-Bound algorithm for Max Clique Problem via cplex-solver
-
Updated
Oct 23, 2021 - Python
This project contains solutions for solving the max clique problem.
-
Updated
Apr 7, 2023 - Rust
Prolog projects on ECLiPSe
-
Updated
Mar 25, 2019 - Prolog
-
Updated
Mar 31, 2022 - Python
This assignment is 2018 spring semester for the course named Data Science in NTHU CS. Find a MAX clique for an undirected graph
-
Updated
Jun 16, 2021 - C++
Improve this page
Add a description, image, and links to the max-clique topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the max-clique topic, visit your repo's landing page and select "manage topics."