Skip to content
@KarlsruheMIS

KaMIS -- Karlsruhe Maximum Independent Sets

This is the open source framework to compute (weighted) independent sets and vertex covers.

Pinned Loading

  1. KaMIS KaMIS Public

    Maximum independent sets and vertex covers of large sparse graphs.

    C++ 78 29

  2. pace-2019 pace-2019 Public

    Winning Solver of PACE Challenge 2019 Track A

    TeX 13 1

  3. red2pack red2pack Public

    Scalable solver for the 2-packing set problem.

    C++ 4

  4. LearnAndReduce LearnAndReduce Public

    GNN guided reduction preprocessing for the Maximum Weight Independent Set problem.

    C++ 2

  5. DataReductions DataReductions Public

    C 1

  6. CHILS CHILS Public

    A concurrent local search heuristic for the Maximum Weight Independent Set problem

    2

Repositories

Showing 7 of 7 repositories

Top languages

Loading…

Most used topics

Loading…