graph-comparison

Tag

Cards List
#graph-comparison

Diffusion enabled Optimal Transport distances for graph matching

arXiv cs.LG · 2026-07-09 Cached

Introduces Diffusion Semi-Relaxed Fused Gromov-Wasserstein (DsrFGW), a novel method that integrates node features and structural connectivity for graph comparison via optimal transport and diffusion processes, demonstrating improved robustness to noise and missing edges on synthetic tasks.

0 favorites 0 likes
← Back to home

Submit Feedback