nalinbhardwaj / min-cut-paper
A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)
☆12Updated 4 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
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated 2 weeks ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆39Updated this week
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆201Updated 2 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 months ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Packed and Compressed Hash Tables☆15Updated last year
- Parallel Balanced Binary Tree Structures☆113Updated this week
- mini is mini☆20Updated 5 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 5 years ago
- An open implementation of the MC family of maximum clique algorithms☆11Updated 8 years ago
- Fast Approximate Membership Filters (C++)☆21Updated 3 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆133Updated last year
- Modeling and Programming with Gecode☆45Updated 2 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 3 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 3 months ago
- ☆17Updated 3 weeks ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆58Updated 4 years ago
- Stand-alone implementation of the progressive indexing algorithms.☆16Updated 4 years ago
- ☆9Updated 6 years ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago
- CPAM: Compressed Parallel Augmented Maps☆23Updated 4 months ago
- Persistent memory allocator for data-centric analytics☆54Updated 3 weeks ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆13Updated 6 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆40Updated 2 months ago