This project contains 3 implementations to solving the maximal clique problem.
-
Updated
Apr 21, 2024 - C++
#
np-hard-problem
Here are 3 public repositories matching this topic...
Algorithm for finding maximal cliques in hamming graph using brute force.
-
Updated
Jan 12, 2024 - C++
machine-learning computer-vision hough-transform shape-detection combinatorial-optimization 3d-space position-tracking line-detection-algorithm convergence-analysis greedy-solution classification-of-image-points introducing-a-priori-knowldge robust-to-low-snr estimating-piecewise-linear-models minimum-number-of-consistent-subsystems np-hard-problem thermal-variant-perception-algorithm relaxation-algorithms projection-to-unit-cylinder temperature-annealing-scheme
-
Updated
Jan 7, 2025 - C++
Improve this page
Add a description, image, and links to the np-hard-problem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the np-hard-problem topic, visit your repo's landing page and select "manage topics."