Maximum independent sets and vertex covers of large sparse graphs.
☆87Sep 30, 2026Updated last month
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
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated 8 months ago
- vertex cover solver☆32Nov 8, 2019Updated 7 years ago
- A benchmarking suite for maximum independent set solvers.☆52Feb 3, 2024Updated 2 years ago
- This repository includes the implementation of the NuSC algorithm and the testing benchmarks.☆10Oct 26, 2022Updated 4 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Python Frontend to Algorithms of the Algorithm Engineering Group Heidelberg☆28Apr 24, 2026Updated 6 months ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated last year
- KaGen: Communication-free Massively Distributed Graph Generators☆45Sep 28, 2026Updated last month
- FREIGHT: Fast Streaming Hypergraph Partitioning — SEA 2023 Best Paper Award☆16Apr 15, 2026Updated 7 months 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…☆10Dec 19, 2022Updated 3 years ago
- A Maximum Independent Set (MIS) solver library using Quantum Computing☆19Nov 9, 2026Updated last week
- KaHIP -- HIGH Quality Partitioning.☆504Updated this week
- Implementation of the Caprara, Fischetti, and Toth algorithm for the Set Covering problem.☆18Mar 5, 2025Updated last year
- Agentic Algorithm Engineering☆36Updated this week
- 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.
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆24Sep 16, 2022Updated 4 years ago
- Vienna Graph Clustering☆19Jun 1, 2026Updated 5 months ago
- Weighted HyperFlowCutter☆10Nov 4, 2026Updated 2 weeks ago
- Multi-platform topology-aware memory management library☆12Apr 23, 2020Updated 6 years ago
- The Belief Propagation approximation for probability distributions on sparse graphs☆26Oct 3, 2026Updated last month
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆71Nov 10, 2026Updated last week
- Immutables as mutables, mutables as immutables.☆22Jul 1, 2026Updated 4 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆13Sep 23, 2026Updated last month
- Feasibility Pump Collection☆16Jul 6, 2023Updated 3 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆12Jan 31, 2022Updated 4 years ago
- Must-read papers on streaming graph☆17Nov 5, 2026Updated last week
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated 2 months ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆38Sep 16, 2026Updated 2 months ago
- ☆11Dec 30, 2020Updated 5 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated last year
- ☆13Aug 10, 2024Updated 2 years ago
- Generic tensor networks for solution space properties.☆117Jul 28, 2025Updated last year
- ML-Based Quantum Error Decoder☆14Jun 10, 2018Updated 8 years ago
- 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.
- Header-only C++23 library for linear, mixed-integer and quadratic programming — one model, any solver, at raw C API speed.☆19Updated this week
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem☆50Updated this week
- ☆16Oct 31, 2026Updated 2 weeks ago
- A standalone local search solver for general integer linear programming☆16Jul 8, 2024Updated 2 years ago
- A more scalable version of FILO.☆33Aug 29, 2026Updated 2 months ago
- LibMVC is a collection of fast iterative minimum vertex cover solvers. Currently NuMVC and FastVC are implemented.☆12Jun 14, 2022Updated 4 years ago
- Thrill - An EXPERIMENTAL Algorithmic Distributed Big Data Batch Processing Framework in C++☆582Aug 30, 2023Updated 3 years ago
Are these results useful?