#

independent-set

Here are 8 public repositories matching this topic...

AsadiAhmad / Max-Independent-Set

Calculating Max Independent Set with greedy algorithm

python algorithm algorithms networkx greedy-algorithms anytree independent-set max-independent-set

Updated Nov 21, 2024
Python

fontanf / setcoveringsolver

A solver for the (unicost) set covering problem

maximum-independent-set dominating-set vertex-cover minimum-weighted-vertex-cover minimum-weighted-dominating-set set-cover maximum-weighted-independent-set set-cover-problem hitting-set minimum-dominating-set independent-set

Updated Apr 18, 2026
C++

CHSZLabLib

CHSZLab / CHSZLabLib

Python Frontend to Algorithms of the Algorithm Engineering Group Heidelberg

python graph-algorithms hpc community-detection streaming-algorithms graph-partitioning hypergraph pybind11 combinatorial-optimization minimum-cut process-mapping dynamic-graphs edge-orientation independent-set

Updated Apr 3, 2026
Python

HyperMIS

KarlsruheMIS / HyperMIS

Open-source project HyperMIS - Hypergraph Maximum Independent Sets.

graph-algorithms data-reduction np-hard graph-theory ilp maximum-independent-set hypergraph combinatorial-optimization perfect-hashing independent-set

Updated Apr 15, 2026
C++

DynWMIS

DynGraphLab / DynWMIS

Fully dynamic solver for the Maximum (Weight) Independent Set problem

algorithm graph dynamic maximum-independent-set algorithm-engineering independent-set dynamic-graph-algorithms

Updated Apr 15, 2026
C++

red2pack

KarlsruheMIS / red2pack

Scalable solver for the 2-packing set problem.

graph-algorithms data-reduction np-hard graph-theory cpp17 combinatorial-optimization independent-set 2-packing-set branch-and-reduce maximum-weight-independent-set

Updated Apr 15, 2026
C++

rostam / GPetersonMIS

Generalized Peterson Maximum Independent Set

cpp graph-theory combinatorics petersen-graph independent-set

Updated Apr 4, 2026
C++

onicolasmendes / TP_PAA_Clique_SAT_Conjunto_Independente_Problemas_NP

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.

graph graphs np-hard np-complete sat np clique clique-graph independent-set

Updated Sep 23, 2024
Python

Improve this page

Add a description, image, and links to the independent-set topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the independent-set topic, visit your repo's landing page and select "manage topics."