Alternatives and similar repositories for graph-partitioning-algorithms

Users that are interested in graph-partitioning-algorithms are comparing it to the libraries listed below

• kshitij1489 / Graph-Partitioning
  The implementation is based on the Fiduccia-Mattheyses algorithm.
  ☆29Updated 8 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆35Updated 5 years ago
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆46Updated 4 years ago
• graphchallenge / GraphChallenge
  Graph Challenge
  ☆31Updated 5 years ago
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆21Updated 5 years ago
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆144Updated 2 weeks ago
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆61Updated 4 years ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• alidasdan / hypergraph-partitioning-algorithms
  Multi-way hypergraph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by…
  ☆20Updated 4 years ago
• LuxGraph / Lux
  A Distributed Multi-GPU System for Fast Graph Processing
  ☆65Updated 6 years ago
• Algebraic-Programming / ALP
  Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…
  ☆27Updated this week
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆84Updated 5 years ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago
• jackwadden / VASim
  VASim is a virtual homogeneous non-deterministic finite automata automata simulator and transformation tool. VASim can parse, transform, …
  ☆36Updated last year
• Liu-Cheng / graph-database-accel-survey
  ☆29Updated 8 years ago
• spcl / mlir-dace
  Data-Centric MLIR dialect
  ☆42Updated last year
• amlatyrngom / SQLIR
  SQL Optimizations using MLIR
  ☆11Updated 5 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• pkumod / GraphSetIntersection
  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
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆102Updated 2 years ago
• IntelLabs / t2sp
  Productive and portable performance programming across spatial architectures (FPGAs, etc.) and vector architectures (GPUs, etc.)
  ☆31Updated last year
• farkhor / CuSha
  CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.
  ☆52Updated 9 years ago
• chenxuhao / GraphAIBench
  A benchmark suite for Graph Machine Learning
  ☆19Updated 8 months ago
• cornell-zhang / GraphLily
  A graph linear algebra overlay
  ☆51Updated 2 years ago
• cornell-zhang / UniSparse
  Code base for OOPSLA'24 paper: UniSparse: An Intermediate Language for General Sparse Format Customization
  ☆30Updated 7 months ago
• pnnl / s-blas
  This package includes the implementation for four sparse linear algebra kernels: Sparse-Matrix-Vector-Multiplication (SpMV), Sparse-Trian…
  ☆26Updated 5 years ago
• pnnl / COMET
  ☆40Updated this week
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• araij / rabbit_order
  ☆46Updated 2 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago