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☆38Updated 3 weeks ago
- ☆9Updated 6 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆39Updated this week
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques☆20Updated last year
- Vienna Graph Clustering☆16Updated 4 months ago
- data files for comparing optimal transport algorithms☆9Updated 5 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆84Updated 5 years ago
- Master's thesis project involving label-constrained reachability (LCR)☆1Updated 4 years ago
- Parallel Balanced Binary Tree Structures☆116Updated 2 months ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆133Updated 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
- mini is mini☆20Updated 5 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆31Updated 10 months ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 5 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆14Updated 2 years ago
- CP 2015 subgraph isomorphism experiments, data and paper☆13Updated 9 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆25Updated last year
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated 7 years ago
- VieCut 1.00 - Shared-memory Minimum Cuts☆45Updated 2 years ago
- Persistent memory allocator for data-centric analytics☆54Updated last week
- High-Performance Streaming Graph Analytics on GPUs☆32Updated 6 years ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago