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:
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Updated 2 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆47Updated 3 weeks ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated last month
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆13Updated 3 weeks ago
- GBBS: Graph Based Benchmark Suite☆214Updated 2 weeks ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 4 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆470Updated 2 months ago
- Vienna Graph Clustering☆17Updated last month
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 4 months ago
- Parallel Weighted Random Sampling☆20Updated 5 years ago
- ☆17Updated 9 months ago
- Graph edge partitioning algorithms☆48Updated 6 years ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆505Updated this week
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆167Updated 2 weeks ago
- Implementation of the HYPE hypergraph partitioner.☆22Updated 6 years ago
- CPAM: Compressed Parallel Augmented Maps☆26Updated 4 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆25Updated last year
- ☆25Updated last month
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆399Updated last month
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆15Updated 9 months ago
- Ligra: A Lightweight Graph Processing Framework for Shared Memory☆484Updated last year
- Dynamic data structure for sparse graphs.☆31Updated last year
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆93Updated this week
- Experimental Setup for Performance Analysis of Streaming Algorithms☆32Updated 4 years ago