Towards Metric-Faithful Neural Graph Matching
概要
arXiv:2605.06588v1 Announce Type: cross Abstract: Graph Edit Distance (GED) is a fundamental, albeit NP-hard, metric for structural graph similarity. Recent neural graph matching architectures approximate GED by first encoding graphs with a Graph Neural Network (GNN) and then applying either a grap…
