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☆14Updated 2 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated last month
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated 3 weeks ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆44Updated this week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆462Updated 6 months ago
- GBBS: Graph Based Benchmark Suite☆213Updated 2 months ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- ☆17Updated 7 months ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆13Updated 3 weeks ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated 2 weeks ago
- ☆25Updated 10 months ago
- ☆25Updated 4 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆25Updated 11 months ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- ☆22Updated 4 years ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 2 months ago
- Vienna Graph Clustering☆16Updated 2 months ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆489Updated last week
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆89Updated 6 years ago
- Implementation of the HYPE hypergraph partitioner.☆22Updated 5 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- A simple implementation of the packed memory array☆20Updated 12 years ago
- Multi-threaded Large-Scale RMAT Graph Generator.☆130Updated 2 years ago
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆12Updated 6 years ago
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆35Updated 3 months ago
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 6 years ago
- New version of pbbs benchmarks☆96Updated last year