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 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☆14Updated 2 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated last week
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- GBBS: Graph Based Benchmark Suite☆214Updated 4 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆45Updated this week
- Parallel Weighted Random Sampling☆19Updated 5 years ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆469Updated last month
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆25Updated last year
- ☆25Updated last week
- ☆17Updated 8 months ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated last month
- Vienna Graph Clustering☆17Updated last month
- Dynamic data structure for sparse graphs.☆31Updated last year
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆501Updated this week
- Graph edge partitioning algorithms☆48Updated 6 years ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 3 months ago
- A simple implementation of the packed memory array☆20Updated 12 years ago
- ☆25Updated 4 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- CPAM: Compressed Parallel Augmented Maps☆26Updated 3 months ago
- ☆26Updated 3 years ago
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆36Updated 4 months ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆33Updated 7 months ago
- Parallel Balanced Binary Tree Structures☆121Updated 8 months ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆32Updated 4 years ago