kittobi1992 / cluster_editing
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
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated last month
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 5 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- ☆17Updated last month
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated last week
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 2 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆38Updated 2 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆74Updated 3 weeks ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆140Updated this week
- ☆17Updated 4 months ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated last month
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 5 years ago
- GBBS: Graph Based Benchmark Suite☆208Updated 4 months ago
- Vienna Graph Clustering☆16Updated 3 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- C++ library for large-scale network analysis and computation☆27Updated last year
- An open implementation of the MC family of maximum clique algorithms☆11Updated 8 years ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- ☆9Updated 6 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 6 months ago
- Packed and Compressed Hash Tables☆15Updated 3 weeks ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆34Updated 10 months ago
- Quickly compute all maximal cliques of a graph☆78Updated 6 years ago
- CPAM: Compressed Parallel Augmented Maps☆24Updated 7 months ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- REplicated STORagE☆13Updated 2 years ago