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
- Vienna Graph Clustering☆18Jun 1, 2026Updated last month
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆56Updated this week
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆30Nov 4, 2024Updated last year
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- FREIGHT: Fast Streaming Hypergraph Partitioning — SEA 2023 Best Paper Award☆16Apr 15, 2026Updated 3 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Jun 27, 2023Updated 3 years ago
- Python Frontend to Algorithms of the Algorithm Engineering Group Heidelberg☆27Apr 24, 2026Updated 3 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- REplicated STORagE☆13Mar 23, 2023Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated last year
- Must-read papers on streaming graph☆15Apr 15, 2026Updated 3 months ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆16Jan 4, 2026Updated 6 months ago
- Code accompanying the paper "Three hypergraph eigenvector centralities."☆12Mar 20, 2019Updated 7 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated 9 months ago
- Agentic Algorithm Engineering☆23Apr 3, 2026Updated 3 months ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆24Sep 16, 2022Updated 3 years ago
- This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).☆11Mar 23, 2026Updated 4 months ago
- Modular decomposition of directed graphs☆13Apr 2, 2025Updated last year
- Learned Monotone Minimal Perfect Hashing☆32Apr 1, 2025Updated last year
- ☆15May 27, 2021Updated 5 years ago
- Implementation of the HYPE hypergraph partitioner.☆22Dec 5, 2019Updated 6 years ago
- ☆18Feb 11, 2026Updated 5 months ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- Can you go outside? Check SCAREDI-PI - the Simple Covid Ambient Reminder E-Ink Display for (Raspberry) Pi☆13Nov 27, 2020Updated 5 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆84Apr 15, 2026Updated 3 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 11 months ago
- Parallel solvers for hard problems☆12Oct 12, 2022Updated 3 years ago
- CP 2015 subgraph isomorphism experiments, data and paper☆13Sep 5, 2015Updated 10 years ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆33Apr 2, 2026Updated 3 months ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆71Updated this week
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆189Updated this week
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated 4 months ago
- 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.
- An open implementation of the MC family of maximum clique algorithms☆14Aug 4, 2016Updated 9 years ago
- A static site generator which supports markdown with LaTeX.☆18Jul 30, 2025Updated 11 months ago
- Double precision SIMD-oriented Fast Mersenne Twister☆43Jul 15, 2025Updated last year
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆14Dec 24, 2022Updated 3 years ago
- Universal Online Judge (UOJ) 样题☆11Sep 23, 2022Updated 3 years ago
- Generate pgfplots or gnuplots from embedded SQL statements☆30May 10, 2025Updated last year
- Rask is a platformer game built with WASM and Rust☆15Jun 7, 2022Updated 4 years ago