GRASP: Simple yet Effective Graph Similarity Predictions

Graph similarity computation (GSC) is to calculate the similarity between one pair of graphs, which is a fundamental problem with fruitful applications in the graph community. In GSC, graph edit distance (GED) and maximum common subgraph (MCS) are two important similarity metrics, both of which are NP-hard to compute. Instead of calculating the exact values, recent solutions resort to leveraging graph neural networks (GNNs) to learn data-driven models for the estimation of GED and MCS. Most of them are built on components involving node-level interactions crossing graphs, which engender vast computation overhead but are of little avail in effectiveness. In the paper, we present GRASP, a simple yet effective GSC approach for GED and MCS prediction. GRASP achieves high result efficacy through several key instruments: enhanced node features via positional encoding and a GNN model augmented by a gating mechanism, residual connections, as well as multi-scale pooling. Theoretically, GRASP can surpass the 1-WL test, indicating its high expressiveness. Empirically, extensive experiments comparing GRASP against 10 competitors on multiple widely adopted benchmark datasets showcase the superiority of GRASP over prior arts in terms of both effectiveness and efficiency.