KaTric: scalable distributed-memory triangle counting made in Karlsruhe
☆14Sep 5, 2023Updated 2 years ago
Alternatives and similar repositories for katric
Users that are interested in katric are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Sep 8, 2025Updated 8 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated 7 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 9 months ago
- REplicated STORagE☆13Mar 23, 2023Updated 3 years ago
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- KaGen: Communication-free Massively Distributed Graph Generators☆43May 20, 2026Updated last week
- Karlsruhe Rapid Ride-Pooling (KaRRi) Dynamic Ride-Pooling Dispatcher.☆13May 21, 2026Updated last week
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated 2 months ago
- ☆17Feb 11, 2026Updated 3 months ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated last year
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Mar 4, 2020Updated 6 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆53Updated this week
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆16Jan 4, 2026Updated 4 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 11 months ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated last year
- A songbook about IT and computer science☆26Mar 24, 2019Updated 7 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…☆11Dec 19, 2022Updated 3 years ago
- Parallel Weighted Random Sampling☆21Dec 9, 2020Updated 5 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆85Apr 15, 2026Updated last month
- Method to measure the amount of allocated memory of a program at run-time.☆70Apr 4, 2022Updated 4 years ago
- Vienna Graph Clustering☆17Apr 15, 2026Updated last month
- Implementation of the HYPE hypergraph partitioner.☆22Dec 5, 2019Updated 6 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated last year
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Scalable Automated Reasoning for HPC and Clouds☆90Updated this week
- This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).☆11Mar 23, 2026Updated 2 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆30Nov 4, 2024Updated last year
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆181May 17, 2026Updated last week
- ☆19Jan 4, 2024Updated 2 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆134Jan 15, 2025Updated last year
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆37Jan 15, 2025Updated last year
- Double precision SIMD-oriented Fast Mersenne Twister☆43Jul 15, 2025Updated 10 months ago
- Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits☆17Oct 15, 2024Updated last year
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Management of Benchmark Instances and Instance Attributes☆21May 22, 2026Updated last week
- Near-linear time algorithm for computing near-maximum independent set☆19Mar 19, 2022Updated 4 years ago
- WWW21 - How Do Hyperedges Overlap☆21Feb 14, 2024Updated 2 years ago
- A Karlsruhe Institute of Technology Slides Theme for Typst. This is only a mirror.☆20Jun 19, 2024Updated last year
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆520Mar 7, 2026Updated 2 months ago
- An experimental implementation of 'try' operator for Go☆13Jun 13, 2019Updated 6 years ago
- ☆13May 11, 2026Updated 2 weeks ago