niklas-uhl / katricLinks
KaTric: scalable distributed-memory triangle counting made in Karlsruhe
☆13Updated last year
Alternatives and similar repositories for katric
Users that are interested in katric are comparing it to the libraries listed below
Sorting:
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 4 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated 3 weeks ago
- ☆17Updated 3 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆39Updated last month
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆10Updated 2 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆40Updated last week
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆51Updated last month
- REplicated STORagE☆13Updated 2 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 2 months ago
- Packed and Compressed Hash Tables☆15Updated 2 months ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- ☆18Updated 6 months ago
- Generate pgfplots or gnuplots from embedded SQL statements☆27Updated last month
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- GBBS: Graph Based Benchmark Suite☆211Updated 6 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆439Updated 2 months ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- Vienna Graph Clustering☆16Updated 5 months ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆27Updated this week
- Parallel Graph Input Output☆19Updated last year
- Maximum independent sets and vertex covers of large sparse graphs.☆77Updated 2 months ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 2 months ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆27Updated 2 years ago
- ☆9Updated 6 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆110Updated 5 months ago