Chaining 2-FWL GNNs for Combinatorial Graph Alignment
DGX agentarXiv:2510.03086v2 Announce Type: replace Abstract: For the combinatorial graph alignment problem (GAP) -- finding the node correspondence that maximizes the number of common edges (nce) between two u