Diffusing node features before semi-relaxed fused Gromov–Wasserstein matching improves synthetic graph alignment accuracy and ARI over plain srFGW, most under medium noise.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Diffusion enabled Optimal Transport distances for graph matching
Diffusing node features before semi-relaxed fused Gromov–Wasserstein matching improves synthetic graph alignment accuracy and ARI over plain srFGW, most under medium noise.