Final project for class HEUR 2020. Finding the maximum clique of a graph using branch and bound algorithm.
Graphs taken from here: https://mat.gsia.cmu.edu/COLOR/instances.html#XXSGB
-
Notifications
You must be signed in to change notification settings - Fork 0
KajetanPoliak/HEUR_max_clique
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Final project for the class HEUR 2020 dealing with finding a maximum clique of a graph using Branch and Bound algorithm.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published