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
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 4 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆443Updated 3 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆43Updated 3 weeks ago
- ☆17Updated 4 months ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated last week
- GBBS: Graph Based Benchmark Suite☆211Updated last week
- KaGen: Communication-free Massively Distributed Graph Generators☆40Updated 2 weeks ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆151Updated this week
- Vienna Graph Clustering☆16Updated 6 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆78Updated last month
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- ☆23Updated 8 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 2 weeks ago
- 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…☆481Updated last month
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- ☆9Updated 6 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆84Updated 2 weeks ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago
- CPAM: Compressed Parallel Augmented Maps☆24Updated last month
- Graph edge partitioning algorithms☆46Updated 5 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆23Updated 9 months ago
- A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)☆12Updated 5 years ago
- Parallel Balanced Binary Tree Structures☆117Updated 4 months ago
- REplicated STORagE☆13Updated 2 years ago