Maximum independent sets and vertex covers of large sparse graphs.
-
Updated
Nov 1, 2024 - C++
Maximum independent sets and vertex covers of large sparse graphs.
Parallel Implementation of some Kernelization algorithms specifically for solving K-Clique problems
Add a description, image, and links to the kernelization topic page so that developers can more easily learn about it.
To associate your repository with the kernelization topic, visit your repo's landing page and select "manage topics."