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++ 73 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

Repositories

Showing 5 of 5 repositories
  • LearnAndReduce Public

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

    KarlsruheMIS/LearnAndReduce’s past year of commit activity
    C++ 2 MIT 0 0 0 Updated Apr 16, 2025
  • KaMIS Public

    Maximum independent sets and vertex covers of large sparse graphs.

    KarlsruheMIS/KaMIS’s past year of commit activity
    C++ 73 MIT 29 6 1 Updated Apr 7, 2025
  • karlsruhemis.github.io Public
    KarlsruheMIS/karlsruhemis.github.io’s past year of commit activity
    HTML 0 0 0 0 Updated Jan 8, 2024
  • red2pack Public

    Scalable solver for the 2-packing set problem.

    KarlsruheMIS/red2pack’s past year of commit activity
    C++ 4 MIT 0 0 0 Updated Oct 6, 2023
  • pace-2019 Public

    Winning Solver of PACE Challenge 2019 Track A

    KarlsruheMIS/pace-2019’s past year of commit activity
    TeX 13 GPL-2.0 1 0 0 Updated Jun 29, 2021

Top languages

Loading…

Most used topics

Loading…