kittobi1992 / cluster_editingLinks
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.
☆10Updated 2 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:
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 months ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated 2 weeks ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆40Updated 2 weeks ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆147Updated this week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆440Updated 2 months ago
- GBBS: Graph Based Benchmark Suite☆211Updated 7 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆78Updated last week
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆43Updated this week
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 4 months ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆476Updated this week
- ☆20Updated 7 months ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Vienna Graph Clustering☆16Updated 6 months ago
- Implementation of the HYPE hypergraph partitioner.☆22Updated 5 years ago
- Graph edge partitioning algorithms☆46Updated 5 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 8 months ago
- Dynamic data structure for sparse graphs.☆29Updated last year
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 3 months ago
- ☆9Updated 6 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- Packed and Compressed Hash Tables☆15Updated 3 months ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago
- Multi-threaded Large-Scale RMAT Graph Generator.☆129Updated last year
- REplicated STORagE☆13Updated 2 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆224Updated 4 years ago