# Subgraph Matching via Partial Optimal Transport

arXiv: https://arxiv.org/abs/2406.19767 · HTML: https://mlsanity.com/paper/2406.19767/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Jun 2024.

## Built on by (most cited first, 1 of 1)

- [Learning Partial Graph Matching via Optimal Partial Transport](https://mlsanity.com/paper/2410.16718/) (2024)

## Abstract (arXiv)

In this work, we propose a novel approach for subgraph matching, the problem of finding a given query graph in a large source graph, based on the fused Gromov-Wasserstein distance. We formulate the subgraph matching problem as a partial fused Gromov-Wasserstein problem, which allows us to build on existing theory and computational methods in order to solve this challenging problem. We extend our method by employing a subgraph sliding approach, which makes it efficient even for large graphs. In numerical experiments, we showcase that our new algorithms have the ability to outperform state-of-the-art methods for subgraph matching on synthetic as well as realworld datasets. In particular, our methods exhibit robustness with respect to noise in the datasets and achieve very fast query times.