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:
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated 3 weeks ago
- GBBS: Graph Based Benchmark Suite☆214Updated last week
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Updated 2 years ago
- Parallel Balanced Binary Tree Structures☆121Updated 9 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- Official code of "PLEX: Towards Practical Learned Indexing", aka TrieSpline (AIDB @VLDB'21)☆15Updated 3 years ago
- Parallel Weighted Random Sampling☆20Updated 5 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆469Updated last month
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆90Updated 6 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- A Benchmark for Learned Indexes