Maximum independent sets and vertex covers of large sparse graphs.
☆85Apr 15, 2026Updated 2 months ago
Alternatives and similar repositories for KaMIS
Users that are interested in KaMIS are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Near-linear time algorithm for computing near-maximum independent set☆19Mar 19, 2022Updated 4 years ago
- vertex cover solver☆31Nov 8, 2019Updated 6 years ago
- Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)☆10Jan 15, 2022Updated 4 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated 3 months ago
- A benchmarking suite for maximum independent set solvers.☆53Feb 3, 2024Updated 2 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated last year
- Algorithms course project to implement branch and bound algorithm on minimum vertex cover problem.☆10Aug 5, 2019Updated 6 years ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 10 months ago
- ☆17Feb 11, 2026Updated 4 months ago
- Vienna Graph Clustering☆18Jun 1, 2026Updated 2 weeks ago
- Feasibility Pump Collection☆16Jul 6, 2023Updated 2 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆155Sep 2, 2024Updated last year
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Sep 8, 2025Updated 9 months ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated 8 months ago
- Automated discovery of optimal branching rules for the branch-and-bound algorithm☆19Dec 15, 2025Updated 6 months ago
- ☆11Apr 16, 2026Updated 2 months ago
- Hardware Accelerated MWPM decoder for Quantum Error Correction☆22Mar 23, 2025Updated last year
- Method to measure the amount of allocated memory of a program at run-time.☆70Apr 4, 2022Updated 4 years ago
- ☆11Dec 30, 2020Updated 5 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆23Sep 16, 2022Updated 3 years ago
- Immutables as mutables, mutables as immutables.☆23May 4, 2026Updated last month
- The Belief Propagation approximation for probability distributions on sparse graphs☆25Jun 8, 2026Updated last week
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆37Jan 15, 2025Updated last year
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated last year
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆54Jun 9, 2026Updated last week
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆257Sep 10, 2024Updated last year
- Implementation of the Caprara, Fischetti, and Toth algorithm for the Set Covering problem.☆18Mar 5, 2025Updated last year
- An exact algorithm for the maximum clique problem (MCP) which improves over state-of-the-art approaches in some cases by orders of magnit…☆16Nov 15, 2025Updated 7 months ago
- ☆24Jun 12, 2024Updated 2 years ago
- LibMVC is a collection of fast iterative minimum vertex cover solvers. Currently NuMVC and FastVC are implemented.☆12Jun 14, 2022Updated 4 years ago
- A naive implementation of the Gomory cutting plane algorithm☆15Apr 3, 2026Updated 2 months ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆70Apr 27, 2026Updated last month
- A standalone local search solver for general integer linear programming☆16Jul 8, 2024Updated last year
- A copy of the latest version of MVSIS☆13Apr 18, 2021Updated 5 years ago
- Thrill - An EXPERIMENTAL Algorithmic Distributed Big Data Batch Processing Framework in C++☆584Aug 30, 2023Updated 2 years ago
- Scalable Automated Reasoning for HPC and Clouds☆90Jun 9, 2026Updated last week
- Optimal gate sizing of digital circuits using geometric programming☆11Aug 18, 2016Updated 9 years ago
- ☆24Dec 4, 2020Updated 5 years ago