Alternatives and similar repositories for mt-kahypar:

Users that are interested in mt-kahypar are comparing it to the libraries listed below

• kahypar / kahypar
  KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…
  ☆456Updated 3 weeks ago
• TILOS-AI-Institute / HypergraphPartitioning
  Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes
  ☆65Updated 5 months ago
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆38Updated this week
• kshitij1489 / Graph-Partitioning
  The implementation is based on the Fiduccia-Mattheyses algorithm.
  ☆29Updated 8 years ago
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆19Updated 5 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆425Updated 2 weeks ago
• Cerebras / ispd2021
  This the contains the test examples and validator tool for the ISPD2021 Wafer-Scale Physics Modeling contest.
  ☆18Updated 4 years ago
• cuhk-eda / GCS-Timer
  ☆20Updated 5 months ago
• Algebraic-Programming / ALP
  Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…
  ☆25Updated 2 weeks ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated last month
• parastuffs / metis_unicorn
  Implementation of hMETIS
  ☆11Updated 2 years ago
• PASSIONLab / CombBLAS
  The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear …
  ☆71Updated last week
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated this week
• chenxm1986 / nicslu
  Parallel sparse direct solver for circuit simulation
  ☆43Updated 2 years ago
• chenxm1986 / cktso
  Pursuing the best performance of linear solver in circuit simulation
  ☆36Updated last month
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 4 months ago
• AUCOHL / OGRE
  Global Router Built for ICCAD Contest 2019
  ☆30Updated 5 years ago
• IntelligentSoftwareSystems / Galois
  Galois: C++ library for multi-core and multi-node parallelization
  ☆323Updated 10 months ago
• cuhk-eda / CULS
  GPU-based logic synthesis tool
  ☆81Updated 8 months ago
• OpenTimer / Parser-SPEF
  A Fast C++ Header-only Parser for Standard Parasitic Exchange Format (SPEF).
  ☆55Updated 2 years ago
• KarypisLab / ParMETIS
  ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering
  ☆133Updated last year
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆204Updated 3 months ago
• lsils / lstools-showcase
  Showcase examples for EPFL logic synthesis libraries
  ☆193Updated 11 months ago
• ABKGroup / TritonPart
  The first version of TritonPart
  ☆24Updated last year
• lamda-bbo / Efficient-TDP
  Official implementation of DATE'25 paper "Timing-Driven Global Placement by Efficient Critical Path Extraction".
  ☆29Updated last month
• PKU-IDEA / OpenPARF
  🕹 OpenPARF: An Open-Source Placement and Routing Framework for Large-Scale Heterogeneous FPGAs with Deep Learning Toolkit
  ☆138Updated last month
• lsils / mockturtle
  C++ logic network library
  ☆225Updated 5 months ago
• limbo018 / Limbo
  Library for VLSI CAD Design Useful parsers and solvers' api are implemented.
  ☆154Updated 3 months ago
• lrakai / gate-sizing
  Optimal gate sizing of digital circuits using geometric programming
  ☆9Updated 8 years ago
• ABKGroup / TritonRoute-WXL
  ☆29Updated 4 years ago