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 2 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 weeks ago
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated last month
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆13Updated 2 weeks ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆43Updated last week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆449Updated 4 months ago
- GBBS: Graph Based Benchmark Suite☆212Updated last month
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated last month
- ☆17Updated 6 months ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆155Updated last week
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆78Updated 2 months ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆483Updated 2 months ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Implementation of the HYPE hypergraph partitioner.☆22Updated 5 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆27Updated 2 years ago
- ☆24Updated 9 months ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆56Updated 2 years ago
- Vienna Graph Clustering☆16Updated last month
- CPAM: Compressed Parallel Augmented Maps☆24Updated last month
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆87Updated this week
- REplicated STORagE☆13Updated 2 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 6 years ago
- Trillion-edge Scale Graph Edge Partitioning☆29Updated 5 years ago
- Graph edge partitioning algorithms☆47Updated 5 years ago
- Code and data for the Clustering Uncertain Graphs paper☆10Updated 2 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 5 months ago
- Management of Benchmark Instances and Instance Attributes☆20Updated last week