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.
☆11Updated 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:
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Updated 2 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 4 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆470Updated last week
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆47Updated last week
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated last week
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆13Updated this week
- Parallel Weighted Random Sampling☆20Updated 5 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- GBBS: Graph Based Benchmark Suite☆215Updated last month
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 5 months ago
- Vienna Graph Clustering☆17Updated 2 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated this week
- ☆17Updated 10 months ago
- ☆26Updated last week
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆29Updated 2 years ago
- Graph edge partitioning algorithms☆48Updated 6 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 6 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 4 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆15Updated 3 weeks ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆27Updated last year
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- CPAM: Compressed Parallel Augmented Maps☆26Updated 5 months ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup☆22Updated 2 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆32Updated 4 years ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆234Updated 4 years ago
- Ligra: A Lightweight Graph Processing Framework for Shared Memory☆486Updated last year
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆33Updated last year