Russian Doll Search for Computing Maximum Vertex Weight Hereditary Structures in Graphs. Now with OpenMP support.
-
Updated
Sep 24, 2023 - C++
Russian Doll Search for Computing Maximum Vertex Weight Hereditary Structures in Graphs. Now with OpenMP support.
A parallel, ant-based algorithm for the Maximum Clique problem.
draft of some research I was doing on graphs
This assignment is 2018 spring semester for the course named Data Science in NTHU CS. Find a MAX clique for an undirected graph
Add a description, image, and links to the max-clique topic page so that developers can more easily learn about it.
To associate your repository with the max-clique topic, visit your repo's landing page and select "manage topics."