Thinklab-SJTU / pygmtoolsLinks
A Python Graph Matching Toolkit.
☆344Updated 2 months ago
Alternatives and similar repositories for pygmtools
Users that are interested in pygmtools are comparing it to the libraries listed below
Sorting:
- The official implementation of NeurIPS22 spotlight paper "NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classifica…☆313Updated last year
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆22Updated 2 years ago
- A graph transformer framework☆77Updated 3 years ago
- Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…☆45Updated 5 months ago
- Awesome machine learning for temporal point processes papers.☆21Updated 3 years ago
- ☆16Updated 2 years ago
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆69Updated last week
- [ICLR 2023 notable top-5%] Rethinking the Expressive Power of GNNs via Graph Biconnectivity (official implementation)☆105Updated 2 years ago
- GLSearch: Maximum Common Subgraph Detection via Learning to Search☆24Updated 2 years ago
- ☆353Updated 10 months ago
- [NeurIPS 2023] Implementation of "Transformers over Directed Acyclic Graphs"☆73Updated 5 months ago
- Official DGL implementation of "Rethinking High-order Graph Convolutional Networks"☆33Updated 4 years ago
- Multilevel graph coarsening algorithm with spectral and cut guarantees☆91Updated 5 years ago
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆68Updated 4 months ago
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆23Updated 7 months ago
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆13Updated 10 months ago
- The repository includes evidence that a published paper in TKDE shares surprisingly high similarity to our paper.☆32Updated 2 years ago
- Code for the KDD 2021 paper "Scaling Up Graph Neural Networks Via Graph Coarsening"☆28Updated last year
- code for the paper "DiGress: Discrete Denoising diffusion for graph generation"☆464Updated 7 months ago
- Recipe for a General, Powerful, Scalable Graph Transformer☆795Updated last year
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆32Updated 3 weeks ago
- A paper collection about automated graph learning☆97Updated last year
- ☆11Updated last year
- Source code for GNN-LSPE (Graph Neural Networks with Learnable Structural and Positional Representations), ICLR 2022☆264Updated 3 years ago
- A benchmarking suite for maximum independent set solvers.☆53Updated last year
- [NeurIPS 2022] "NSNet: A General Neural Probabilistic Framework for Satisfiability Problems"☆19Updated 2 years ago
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆225Updated last year
- Easily download anonymous Github repositories from https://anonymous.4open.science/ with a GUI interface☆96Updated last year
- This is the official code repository for "Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPs".☆91Updated last year
- Random Walk Graph Neural Networks☆54Updated 4 years ago