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
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 4 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆39Updated last month
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆40Updated last week
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- ☆17Updated 3 months ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated 3 weeks ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆77Updated 2 months ago
- Packed and Compressed Hash Tables☆15Updated 2 months ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 2 months ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆27Updated 2 years ago
- Vienna Graph Clustering☆16Updated 5 months ago
- ☆18Updated 6 months ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆27Updated this week
- REplicated STORagE☆13Updated 2 years ago
- ☆9Updated 6 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆439Updated 2 months ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆51Updated last month
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆66Updated this week
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆33Updated last year
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- GBBS: Graph Based Benchmark Suite☆211Updated 6 months ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 7 months ago
- VieCut 1.00 - Shared-memory Minimum Cuts☆45Updated 2 years ago
- Graph edge partitioning algorithms☆46Updated 5 years ago
- CPAM: Compressed Parallel Augmented Maps☆24Updated 8 months ago