JMLR 2024
Pygmtools: A Python Graph Matching Toolkit
Abstract
Graph matching aims to find node-to-node matching among multiple graphs, which is a fundamental yet challenging problem. To facilitate graph matching in scientific research and industrial applications, pygmtools is released, which is a Python graph matching toolkit that implements a comprehensive collection of two-graph matching and multi-graph matching solvers, covering both learning-free solvers as well as learning-based neural graph matching solvers. Our implementation supports numerical backends including Numpy, PyTorch, Jittor, Paddle, runs on Windows, MacOS and Linux, and is friendly to install and configure. Comprehensive documentations covering beginner's guide, API reference and examples are available online. pygmtools is open-sourced under Mulan PSL v2 license. [abs] [ pdf ][ bib ] [ code ] © JMLR 2024. ( edit, beta )
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- Journal of Machine Learning Research
- Archive span
- 2000-2026
- Indexed papers
- 4180
- Paper id
- 467868642265008477