KaMIS

KarlsruheMIS

Maximum independent sets and vertex covers of large sparse graphs.

algorithm

View on GitHub Website

83 Stars

33 Forks

83 Watchers

C++ Language

mit License

100 SrcLog Score

Cost to Build

$1.85M

Market Value

$6.24M

How is this calculated?

Growth over time

8 data points · 2021-08-01 → 2026-04-01

Stars Forks Watchers

💬

How do you feel about this project?

Ask AI about KaMIS

Question copied to clipboard

What is the KarlsruheMIS/KaMIS GitHub project? Description: "Maximum independent sets and vertex covers of large sparse graphs.". Written in C++. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone KaMIS

Clone via HTTPS

git clone https://github.com/KarlsruheMIS/KaMIS.git

Clone via SSH

[email protected]:KarlsruheMIS/KaMIS.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the KaMIS issue tracker:

Open GitHub Issues

Similar to KaMIS

javascript-algorithms CS-Notes interviews tech-interview-handbook interactive-coding-challenges algorithms algorithm-visualizer cosmos WaveFunctionCollapse JCSprout Python LeetCode javascript-algorithms awesome-java-leetcode turf awesome-competitive-programming AlgoWiki algorithms Learn-Algorithms PythonRobotics illustrated-algorithms machine_learning_basics EKAlgorithms algorithms_and_data_structures java-algorithms-implementation LeetCode-Swift leet-code ngraph.path C-Sharp-Algorithms Lean