alidasdan / graph-partitioning-algorithms
Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free Moves)
☆38Updated 4 years ago
Alternatives and similar repositories for graph-partitioning-algorithms:
Users that are interested in graph-partitioning-algorithms are comparing it to the libraries listed below
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆29Updated 8 years ago
- SMASH is a hardware-software cooperative mechanism that enables highly-efficient indexing and storage of sparse matrices. The key idea of…☆16Updated 4 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆140Updated last week
- ☆9Updated 6 years ago
- Implementation of the HYPE hypergraph partitioner.☆19Updated 5 years ago
- A Dataflow library for graph analytics acceleration☆14Updated 9 years ago
- A list of all publications related to the KaHyPar frameworks.☆11Updated 3 years ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆66Updated 6 months ago
- Multi-way hypergraph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by…☆20Updated 4 years ago
- A graph linear algebra overlay☆51Updated 2 years ago
- Macro placement tool for OpenROAD flow☆23Updated 4 years ago
- OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP. Integrated with Sniper simulator.☆11Updated last year
- A benchmark suite for Graph Machine Learning☆18Updated 6 months ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆25Updated last week
- Library of corner stitching structure☆17Updated 9 years ago
- DATuner Repository☆18Updated 6 years ago
- Productive and portable performance programming across spatial architectures (FPGAs, etc.) and vector architectures (GPUs, etc.)☆31Updated 11 months ago
- Concurrent CPU-GPU Programming using Task Models☆101Updated 5 years ago
- ☆30Updated 2 years ago
- The programming runtime and interfaces for ARENA.☆14Updated 3 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆30Updated 6 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆61Updated 4 years ago
- A Comprehensive Benchmark Suite for Graph Computing☆68Updated 6 years ago
- Graph Coarsening and Partitioning Library☆32Updated 5 years ago
- GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators☆30Updated 3 years ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆35Updated 5 years ago
- A Shared Memory Multithreaded Graph Benchmark Suite for Multicores☆35Updated 2 years ago
- An infrastructure for integrated EDA☆38Updated last year