Alternatives and similar repositories for hypergraph-partitioning-algorithms

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

• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆171Updated this week
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆22Updated 6 years ago
• shininglion / corner_stitch
  Library of corner stitching structure
  ☆19Updated 10 years ago
• asfhiolNick / NTU_PhysicalDesign_201902
  張耀文老師的"奈米積體電路實體設計"作業(Physical Design)
  ☆10Updated 2 years ago
• alidasdan / graph-partitioning-algorithms
  Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free…
  ☆38Updated last month
• parastuffs / metis_unicorn
  Implementation of hMETIS
  ☆13Updated 3 years ago
• kahypar / kahypar
  KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…
  ☆506Updated 3 weeks ago
• CMU-SAFARI / SMASH
  SMASH is a hardware-software cooperative mechanism that enables highly-efficient indexing and storage of sparse matrices. The key idea of…
  ☆18Updated 5 years ago
• parallella / openeda
  Open source EDA chip design flow
  ☆51Updated 8 years ago
• limbo018 / OpenMPL
  An open multiple patterning framework
  ☆82Updated last year
• NVlabs / CircuitOps
  ☆97Updated 7 months ago
• TILOS-AI-Institute / HypergraphPartitioning
  Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes
  ☆76Updated 3 weeks ago
• PKU-IDEA / OpenPARF
  🕹 OpenPARF: An Open-Source Placement and Routing Framework for Large-Scale Heterogeneous FPGAs with Deep Learning Toolkit
  ☆169Updated 9 months ago
• pnnl / arena
  The programming runtime and interfaces for ARENA.
  ☆14Updated 4 years ago
• The-OpenROAD-Project / PDNSim
  Power grid analysis
  ☆20Updated 5 years ago
• shininglion / rectilinear_spanning_graph
  This library contains rectilinear spanning graph construction, finding minimum spanning tree and an implementation of binary search tree
  ☆10Updated 10 years ago
• jkim971201 / SkyPlace
  ☆20Updated last year
• cuhk-eda / REST
  REST, a reinforcement learning framework for constructing rectilinear Steiner Minimum tree (RSMT)
  ☆59Updated 3 years ago
• lnis-uofu / ML-Mapper
  ☆13Updated 3 years ago
• cornell-zhang / datuner
  DATuner Repository
  ☆17Updated 7 years ago
• lsils / mockturtle
  C++ logic network library
  ☆275Updated 4 months ago
• lydiawunan / LOSTIN
  LOSTIN: Logic Optimization via Spatio-Temporal Information with Hybrid Graph Models
  ☆26Updated 3 years ago
• lrakai / gate-sizing
  Optimal gate sizing of digital circuits using geometric programming
  ☆11Updated 9 years ago
• NYU-MLDA / OpenABC
  OpenABC-D is a large-scale labeled dataset generated by synthesizing open source hardware IPs. This dataset can be used for various graph…
  ☆141Updated 6 months ago
• scale-lab / OpenPhySyn
  EDA physical synthesis optimization kit
  ☆64Updated 2 years ago
• luckyrantanplan / nthu-route
  VLSI EDA Global Router
  ☆79Updated 8 years ago
• Daikon-Sun / Physical-Design-for-Nanometer-ICs
  Assignments of Physical Design for Nanometer ICs (Spring 2017, Prof. Yao-Wen Chang)
  ☆45Updated 7 years ago
• wvangansbeke / High-Level-Synthesis
  Convert C files into Verilog
  ☆20Updated 7 years ago
• chengengjie / salt
  Steiner Shallow-Light Tree for VLSI Routing
  ☆62Updated last year
• en9inerd / SimAn
  Standard cell placement (global and detailed) tool based on modified algorithm “simulated annealing”
  ☆12Updated last month