Maximum independent sets and vertex covers of large sparse graphs.
☆81Jan 29, 2026Updated last month
Alternatives and similar repositories for KaMIS
Users that are interested in KaMIS are comparing it to the libraries listed below
Sorting:
- Near-linear time algorithm for computing near-maximum independent set☆19Mar 19, 2022Updated 3 years ago
- vertex cover solver☆31Nov 8, 2019Updated 6 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Jun 29, 2021Updated 4 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Mar 4, 2020Updated 6 years ago
- A benchmarking suite for maximum independent set solvers.☆52Feb 3, 2024Updated 2 years ago
- This Is Indian Country - Spring 2018 Instance☆12Apr 30, 2018Updated 7 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☆41Feb 27, 2026Updated last week
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated 11 months ago
- Vienna Graph Clustering☆17Feb 10, 2026Updated 3 weeks ago
- ☆17Feb 11, 2026Updated 3 weeks ago
- ☆11Dec 30, 2020Updated 5 years ago
- Feasibility Pump Collection☆16Jul 6, 2023Updated 2 years ago
- 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 3 months ago
- The Belief Propagation approximation for probability distributions on sparse graphs☆25Nov 24, 2025Updated 3 months ago
- Immutables as mutables, mutables as immutables.☆23Feb 21, 2026Updated 2 weeks ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Sep 8, 2025Updated 6 months ago
- Multi-platform topology-aware memory management library☆13Apr 23, 2020Updated 5 years ago
- ☆12Feb 9, 2026Updated 3 weeks ago
- Hardware Accelerated MWPM decoder for Quantum Error Correction☆18Mar 23, 2025Updated 11 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆474Feb 10, 2026Updated 3 weeks ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆12Jan 31, 2022Updated 4 years ago
- A fast compressor/decompressor☆16Nov 18, 2024Updated last year
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆243Sep 10, 2024Updated last year
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 5 months ago
- Julia interface for the Blossom V perfect matching algorithm☆14Nov 27, 2020Updated 5 years ago
- A naive implementation of the Gomory cutting plane algorithm☆16May 11, 2020Updated 5 years ago
- Dartmouth Formula Racing Central Vehicle Controller Codebase☆10Apr 3, 2023Updated 2 years ago
- ☆19Jun 12, 2024Updated last year
- Automated discovery of optimal branching rules for the branch-and-bound algorithm☆18Dec 15, 2025Updated 2 months ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆36Jan 15, 2025Updated last year
- Implementation of the Caprara, Fischetti, and Toth algorithm for the Set Covering problem.☆18Mar 5, 2025Updated last year
- Integrating Neural Ordinary Differential Equations, the Method of Lines, and Graph Neural Networks☆18Oct 29, 2023Updated 2 years ago
- DPDP☆105Jan 2, 2023Updated 3 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
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆49Jan 22, 2026Updated last month
- ☆38May 3, 2023Updated 2 years ago
- Tradução para o português do livro ThinkJulia☆16Jun 18, 2021Updated 4 years ago