Alternatives and similar repositories for MetaVC:

Users that are interested in MetaVC are comparing it to the libraries listed below

• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 4 months ago
• DfX-NYUAD / GNN4IC
  Must-read papers on Graph Neural Networks (GNNs) for Integrated Circuits (ICs) design, security and reliability.
  ☆45Updated 3 weeks ago
• sorarain / RoutePlacer
  ☆12Updated 9 months ago
• TILOS-AI-Institute / HypergraphPartitioning
  Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes
  ☆65Updated 5 months ago
• cuhk-eda / REST
  REST, a reinforcement learning framework for constructing rectilinear Steiner Minimum tree (RSMT)
  ☆54Updated 2 years ago
• cure-lab / DeepGate
  This is an official implementation for "DeepGate: Learning Neural Representations of Logic Gates".
  ☆21Updated last year
• kkunal1408 / GANA_circuit_data
  just checking
  ☆15Updated 2 years ago
• zshi0616 / DeepGate2
  ☆28Updated last year
• MaxiBoether / mis-benchmark-framework
  A benchmarking suite for maximum independent set solvers.
  ☆50Updated last year
• kshitij1489 / Graph-Partitioning
  The implementation is based on the Fiduccia-Mattheyses algorithm.
  ☆29Updated 8 years ago
• krzhu / abc_py
  Simple Python interface for ABC
  ☆23Updated last year
• lamda-bbo / macro-regulator
  Official implementation of NeurIPS'24 paper "Reinforcement Learning Policy as Macro Regulator Rather than Macro Placer".
  ☆12Updated 3 weeks ago
• shaowei-cai-group / EasySAT
  A Simple CDCL Solver
  ☆28Updated 2 years ago
• wata-orz / vertex_cover
  vertex cover solver
  ☆30Updated 5 years ago
• PKUterran / NetlistGNN
  ☆42Updated 2 years ago
• laiyao1 / ArithmeticTree
  The release for paper "Scalable and Effective Arithmetic Tree Generation for Adder and Multiplier Designs"
  ☆10Updated 6 months ago
• CMACH508 / DeepTH
  ☆14Updated 10 months ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• baloneymath / AncstrGNN
  ☆15Updated 3 years ago
• MIRALab-USTC / ChiPBench
  ChiPBench:Benchmarking End-to-End Performance of AI-based Chip Placement Algorithms
  ☆29Updated last week
• lydiawunan / LOSTIN
  LOSTIN: Logic Optimization via Spatio-Temporal Information with Hybrid Graph Models
  ☆22Updated 2 years ago
• SJTU-ECTL / ALSRAC
  ALSRAC: Approximate Logic Synthesis by Resubstitution with Approximate Care Set
  ☆19Updated 3 months ago
• ywtseng / NTUPlacement
  ☆12Updated 6 years ago
• ABKGroup / TritonRoute-WXL
  ☆29Updated 4 years ago
• ryanzhangfan / NeuroSAT
  PyTorch implementation of NeuroSAT
  ☆28Updated last year
• ABKGroup / PlacementEssentialReadings
  ☆53Updated 4 years ago
• shaowei-cai-group / ParKissat-RS
  Parallel SAT solver that won the SAT Competition 2022 by a large margin (24% faster than the 2nd ranked solver)
  ☆23Updated 2 years ago
• saurabhdash / GCN_Partitioning
  Graph Partitoning Using Graph Convolutional Networks
  ☆65Updated 2 years ago
• Yu-Maryland / Gamora
  Gamora: Graph Learning based Symbolic Reasoning for Large-Scale Boolean Networks (DAC'23)
  ☆49Updated 2 months ago
• cure-lab / DeepGate2
  ☆14Updated last year