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 2 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated 2 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆13Updated this week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆458Updated 5 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated last month
- GBBS: Graph Based Benchmark Suite☆213Updated 2 months ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- 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 last month
- ☆17Updated 6 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆24Updated 11 months ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆27Updated 2 years ago
- Vienna Graph Clustering☆16Updated 2 months ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- ☆25Updated 10 months ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆158Updated last week
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆485Updated 3 months ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 6 months ago
- Graph edge partitioning algorithms☆47Updated 5 years ago
- Implementation of the HYPE hypergraph partitioner.☆22Updated 5 years ago
- An open implementation of the MC family of maximum clique algorithms☆12Updated 9 years ago
- ☆22Updated 4 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆31Updated this week
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆382Updated 3 weeks ago
- Packed and Compressed Hash Tables☆15Updated 6 months ago
- Ligra: A Lightweight Graph Processing Framework for Shared Memory☆478Updated last year