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