KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint union of complete graphs) by performing a minimum number of edge editing operations.
☆11Dec 19, 2022Updated 3 years ago
Alternatives and similar repositories for cluster_editing
Users that are interested in cluster_editing are comparing it to the libraries listed below
Sorting:
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Mar 4, 2020Updated 6 years ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated 10 months ago
- Vienna Graph Clustering☆17Feb 10, 2026Updated 3 weeks ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆49Jan 22, 2026Updated last month
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆28Nov 4, 2024Updated last year
- Code accompanying the paper "Three hypergraph eigenvector centralities."☆12Mar 20, 2019Updated 6 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆15Jan 4, 2026Updated 2 months ago
- REplicated STORagE☆13Mar 23, 2023Updated 2 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 8 months ago
- Implementation of the HYPE hypergraph partitioner.☆22Dec 5, 2019Updated 6 years ago
- ☆17Feb 11, 2026Updated 3 weeks ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Jun 27, 2023Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 11 months ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆33Updated this week
- Some useful utilities for OI written in C++.☆10Apr 13, 2022Updated 3 years ago
- Polish language support for Ruby on Rails☆27Feb 6, 2020Updated 6 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆81Jan 29, 2026Updated last month
- ☆20Feb 21, 2026Updated last week
- A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)☆12Apr 24, 2020Updated 5 years ago
- This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).☆11Jan 8, 2024Updated 2 years ago
- ☆10Oct 29, 2020Updated 5 years ago
- Towards Foundation Models for Mixed Integer Linear Programming☆15Feb 3, 2025Updated last year
- FlowCutter submission to PACE 2016☆12Sep 20, 2016Updated 9 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Sep 2, 2021Updated 4 years ago
- ngrok API client library for Ruby☆12Jan 23, 2026Updated last month
- Mojito's events, tables & data modelling steps for use in Snowplow Analytics☆11Mar 12, 2021Updated 4 years ago
- Multi-platform topology-aware memory management library☆13Apr 23, 2020Updated 5 years ago
- [DAMI'23 (ECMLPKDD'23 Journal Track)] Hypercore Decomposition for Non-Fragile Hyperedges: Concepts, Algorithms, Observations, and Applica…☆11Feb 15, 2024Updated 2 years ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆13Updated this week
- Modular decomposition of directed graphs☆13Apr 2, 2025Updated 11 months ago
- ☆12Aug 12, 2024Updated last year
- Caddy gives you an auto-updating global cache to speed up your web requests.☆12Sep 13, 2016Updated 9 years ago
- Double precision SIMD-oriented Fast Mersenne Twister☆42Jul 15, 2025Updated 7 months ago
- A TUI for managing Hetzner Cloud resources☆16Jan 31, 2026Updated last month
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 6 months ago
- acm.sgu.ru☆10Jan 7, 2015Updated 11 years ago
- ☆11Feb 21, 2023Updated 3 years ago
- ☆10Oct 19, 2022Updated 3 years ago