Python Frontend to Algorithms of the Algorithm Engineering Group Heidelberg
Calculating Max Independent Set with greedy algorithm
A solver for the (unicost) set covering problem
Open-source project HyperMIS - Hypergraph Maximum Independent Sets.
Fully dynamic solver for the Maximum (Weight) Independent Set problem
Scalable solver for the 2-packing set problem.
a browser app that calculates the precise average and standard deviation of all the choices for the np-complete problems in polynomial time. It treats the problems as a thermal dynamic system and assign probabilities to witnesses using the Boltzmann distribution. The partition function is approximated using the entropy and a Taylor expansion.
Generalized Peterson Maximum Independent Set
Implementation of three fundamental algorithms in graph theory and Boolean logic: Satisfiability (SAT), Clique, and Independent Set. Each problem is addressed using various optimization and search techniques.
A structural-discovery framework for discovering theorem-revealing representations, with proved local-to-global graph structure, intrinsic defect parameters, and independent Python/C++ verification — the Shunyaya Structural Discovery Compiler (SSDC).
Sharp median-graph realizations by maximum-independent-set token sliding in König-Egerváry graphs
To associate your repository with the independent-set topic, visit your repo's landing page and select "manage topics."