Deriving the node-matching matrix from a cost matrix via optimal transport improves approximate graph edit distance and edit path generation on small benchmark graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computing Approximate Graph Edit Distance via Optimal Transport
Deriving the node-matching matrix from a cost matrix via optimal transport improves approximate graph edit distance and edit path generation on small benchmark graphs.