Maximum independent sets and vertex covers of large sparse graphs.
☆83Apr 15, 2026Updated 3 weeks 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
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Mar 4, 2020Updated 6 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated last month
- A benchmarking suite for maximum independent set solvers.☆52Feb 3, 2024Updated 2 years 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.
- 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
- KaGen: Communication-free Massively Distributed Graph Generators☆43Mar 27, 2026Updated last month
- This Is Indian Country - Spring 2018 Instance☆12Apr 30, 2018Updated 8 years ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 8 months ago
- ☆17Feb 11, 2026Updated 2 months ago
- Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL☆78Apr 8, 2019Updated 7 years ago
- Vienna Graph Clustering☆17Apr 15, 2026Updated 3 weeks ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- Multi-platform topology-aware memory management library☆13Apr 23, 2020Updated 6 years 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 8 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 7 months ago
- Automated discovery of optimal branching rules for the branch-and-bound algorithm☆19Dec 15, 2025Updated 4 months ago
- ☆12Apr 16, 2026Updated 3 weeks ago
- Hardware Accelerated MWPM decoder for Quantum Error Correction☆20Mar 23, 2025Updated last year
- A Maximum Independent Set (MIS) solver library using Quantum Computing☆19Apr 9, 2026Updated last month
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- 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
- The Belief Propagation approximation for probability distributions on sparse graphs☆25Apr 20, 2026Updated 2 weeks ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆37Jan 15, 2025Updated last year
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 10 months ago
- ☆16Apr 21, 2025Updated last year
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆12Jan 31, 2022Updated 4 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆53May 1, 2026Updated last week
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆255Sep 10, 2024Updated 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…☆15Nov 15, 2025Updated 5 months ago
- ☆22Jun 12, 2024Updated last year
- LibMVC is a collection of fast iterative minimum vertex cover solvers. Currently NuMVC and FastVC are implemented.☆12Jun 14, 2022Updated 3 years ago
- ML-Based Quantum Error Decoder☆14Jun 10, 2018Updated 7 years ago
- A naive implementation of the Gomory cutting plane algorithm☆16Apr 3, 2026Updated last month
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆69Apr 27, 2026Updated last week