nalinbhardwaj / min-cut-paperLinks
A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)
☆12Updated 5 years ago
Alternatives and similar repositories for min-cut-paper
Users that are interested in min-cut-paper are comparing it to the libraries listed below
Sorting:
- Parallel Balanced Binary Tree Structures☆117Updated 4 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆40Updated 2 weeks ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 3 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆443Updated 3 months ago
- GBBS: Graph Based Benchmark Suite☆211Updated last week
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 4 months ago
- Vienna Graph Clustering☆16Updated 6 months ago
- Official code of "PLEX: Towards Practical Learned Indexing" (aka TrieSpline)☆14Updated 3 years ago
- SkinnerDB is an analytical database management system. It uses adaptive processing and reinforcement learning to find near-optimal join o…☆49Updated last year
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 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 7 months ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆417Updated 7 months ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 4 months ago
- ☆38Updated 5 years ago
- ☆17Updated 4 months ago
- ☆9Updated 6 years ago
- A simple implementation of the packed memory array☆20Updated 11 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆43Updated 3 weeks 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
- Packed and Compressed Hash Tables☆15Updated 4 months ago
- A Benchmark for Learned Indexes☆287Updated 3 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- ☆25Updated 4 years ago
- An open-source framework for concurrent data-structures and benchmarks. 🛠️ Latest Dev Branch: v3.4.0-dev 🚀 https://github.com/nkallima/…☆68Updated 4 months ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago