Maximum independent sets and vertex covers of large sparse graphs.
-
Updated
Jul 8, 2024 - C++
Maximum independent sets and vertex covers of large sparse graphs.
Chess engine
Reductions from theoretical computer science
Add a description, image, and links to the reductions topic page so that developers can more easily learn about it.
To associate your repository with the reductions topic, visit your repo's landing page and select "manage topics."