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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated last year
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Mar 4, 2020Updated 6 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆50Mar 25, 2026Updated 3 weeks ago
- Vienna Graph Clustering☆17Mar 23, 2026Updated 3 weeks ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆29Nov 4, 2024Updated last year
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Jun 27, 2023Updated 2 years ago
- REplicated STORagE☆13Mar 23, 2023Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 9 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆16Jan 4, 2026Updated 3 months ago
- Code accompanying the paper "Three hypergraph eigenvector centralities."☆12Mar 20, 2019Updated 7 years ago
- This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).