Maximum independent sets and vertex covers of large sparse graphs.
☆83Mar 23, 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
- Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)☆10Jan 15, 2022Updated 4 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
- 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 benchmarking suite for maximum independent set solvers.☆52Feb 3, 2024Updated 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
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆11Dec 19, 2022Updated 3 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆43Mar 27, 2026Updated 3 weeks ago
- ☆17Feb 11, 2026Updated 2 months ago
- KaHIP -- HIGH Quality Partitioning.☆478Updated this week
- Vienna Graph Clustering☆17Updated this week
- Multi-platform topology-aware memory management library☆13Apr 23, 2020Updated 5 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- 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 7 months ago
- ☆12Updated this week
- Hardware Accelerated MWPM decoder for Quantum Error Correction☆19Mar 23, 2025Updated last year
- A Maximum Independent Set (MIS) solver library using Quantum Computing☆19Apr 9, 2026Updated last week
- 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
- Serverless GPU API endpoints on Runpod - Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Immutables as mutables, mutables as immutables.☆23Apr 1, 2026Updated 2 weeks ago
- The Belief Propagation approximation for probability distributions on sparse graphs☆25Apr 8, 2026Updated last week
- 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
- 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☆50Mar 25, 2026Updated 3 weeks ago
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆254Sep 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 …☆15Nov 15, 2025Updated 5 months ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- ☆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
- 一个低代码、可定制（颜色、字体、模块）的LaTeX中文模板（自用/持续更新）☆29Feb 13, 2026Updated 2 months ago
- ML-Based Quantum Error Decoder☆14Jun 10, 2018Updated 7 years ago
- A naive implementation of the Gomory cutting plane algorithm☆16Apr 3, 2026Updated 2 weeks ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆68Updated this week
- Implementation of the HYPE hypergraph partitioner.☆22Dec 5, 2019Updated 6 years ago