KarlsruheMIS / KaMISView external linksLinks
Maximum independent sets and vertex covers of large sparse graphs.
☆79Jan 29, 2026Updated 2 weeks ago
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
- Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)☆10Jan 15, 2022Updated 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 5 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
- 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☆41Feb 3, 2026Updated last week
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated 10 months 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…☆14Nov 15, 2025Updated 3 months ago
- Feasibility Pump Collection☆16Jul 6, 2023Updated 2 years ago
- The Belief Propagation approximation for probability distributions on sparse graphs☆25Nov 24, 2025Updated 2 months ago
- Immutables as mutables, mutables as immutables.☆23Jan 25, 2026Updated 3 weeks ago
- Multi-platform topology-aware memory management library☆13Apr 23, 2020Updated 5 years ago
- Hardware Accelerated MWPM decoder for Quantum Error Correction☆18Mar 23, 2025Updated 10 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Sep 8, 2025Updated 5 months ago
- ☆12Feb 9, 2026Updated last week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆473Jan 23, 2026Updated 3 weeks ago
- ☆14Jun 12, 2024Updated last year
- A fast compressor/decompressor☆16Nov 18, 2024Updated last year
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆13Jan 31, 2022Updated 4 years ago
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆241Sep 10, 2024Updated last year
- A Maximum Independent Set (MIS) solver library using Quantum Computing☆19Updated this week
- Dartmouth Formula Racing Central Vehicle Controller Codebase☆10Apr 3, 2023Updated 2 years 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
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆35Jan 15, 2025Updated last year
- Method to measure the amount of allocated memory of a program at run-time.☆70Apr 4, 2022Updated 3 years ago
- Implementation of the Caprara, Fischetti, and Toth algorithm for the Set Covering problem.☆18Mar 5, 2025Updated 11 months ago
- DPDP☆105Jan 2, 2023Updated 3 years ago
- ☆25Jan 11, 2025Updated last year
- ☆38May 3, 2023Updated 2 years ago
- A standalone local search solver for general integer linear programming☆16Jul 8, 2024Updated last year
- Tradução para o português do livro ThinkJulia☆16Jun 18, 2021Updated 4 years ago
- A package for reading and writing files with delimited values (Originally a Julia stdlib)☆20Dec 28, 2025Updated last month
- A Julia package for working with objects in fusion categories☆17Updated this week