Maximum independent sets and vertex covers of large sparse graphs.
☆87Sep 30, 2026Updated last week
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
- 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 6 months ago
- A benchmarking suite for maximum independent set solvers.☆52Feb 3, 2024Updated 2 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…☆10Dec 19, 2022Updated 3 years 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.
- Algorithms course project to implement branch and bound algorithm on minimum vertex cover problem.☆10Aug 5, 2019Updated 7 years ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated last year
- FREIGHT: Fast Streaming Hypergraph Partitioning — SEA 2023 Best Paper Award☆16Apr 15, 2026Updated 5 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆44Sep 28, 2026Updated last week
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated last year
- This Is Indian Country - Spring 2018 Instance☆12Apr 30, 2018Updated 8 years ago
- Agentic Algorithm Engineering☆28Sep 22, 2026Updated 2 weeks ago
- ☆18Feb 11, 2026Updated 7 months ago
- Vienna Graph Clustering☆18Jun 1, 2026Updated 4 months 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.
- KaHIP -- HIGH Quality Partitioning.☆500Sep 16, 2026Updated 3 weeks ago
- 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
- Feasibility Pump Collection☆16Jul 6, 2023Updated 3 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆13Sep 23, 2026Updated 2 weeks ago
- Header-only C++23 bucket graph labeling for the SPPRC — the pricing subproblem in vehicle routing column generation☆29Sep 28, 2026Updated last week
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆155Sep 2, 2024Updated 2 years ago
- The Belief Propagation approximation for probability distributions on sparse graphs☆26Updated this week
- ☆12Jul 31, 2026Updated 2 months ago
- Method to measure the amount of allocated memory of a program at run-time.☆71Apr 4, 2022Updated 4 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.
- Immutables as mutables, mutables as immutables.☆22Jul 1, 2026Updated 3 months ago
- ☆16Apr 21, 2025Updated last year
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆71Aug 31, 2026Updated last month
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆37Sep 16, 2026Updated 3 weeks ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated 3 weeks ago
- Must-read papers on streaming graph☆15Apr 15, 2026Updated 5 months ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆12Jan 31, 2022Updated 4 years ago
- A Maximum Independent Set (MIS) solver library using Quantum Computing☆19Aug 20, 2026Updated last month
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated last year
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆266Sep 10, 2024Updated 2 years ago
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem☆48Jul 9, 2026Updated 2 months ago
- A naive implementation of the Gomory cutting plane algorithm☆15Apr 3, 2026Updated 6 months ago
- Automated discovery of optimal branching rules for the branch-and-bound algorithm☆19Sep 14, 2026Updated 3 weeks ago
- A copy of the latest version of MVSIS☆13Apr 18, 2021Updated 5 years ago
- Aquaplanning QUick Automated Planning.☆13Oct 13, 2020Updated 5 years ago
- Optimal gate sizing of digital circuits using geometric programming☆11Aug 18, 2016Updated 10 years ago