HGED: A Hybrid Search Algorithm for Efficient Parallel Graph Edit Distance Computation

Graph edit distance (GED) is a measure for quantifying the similarity between two graphs. Because of its flexibility and versatility, GED is widely used in many real applications. However, the main disadvantage of GED is its high computational cost. Many solutions have been proposed to speed up GED computation, but most of them focus on developing serial algorithms and only very few solutions consider parallel computing. In this paper, we study a parallel GED computation to elaborate a fast and precise algorithm. Unlike existing solutions that utilize either a depth-first or a best-first search, we propose a hybrid approach that combines depth-first and best-first search paradigms. Our approach can quickly find tighter GED upper bounds, and effectively prune the search space using the upper bounds. Based on the approach, we develop an efficient parallel GED computation algorithm named <inline-formula> <tex-math notation="LaTeX">${\sf HGED}$ </tex-math></inline-formula>. To maximize thread utility, <inline-formula> <tex-math notation="LaTeX">${\sf HGED}$ </tex-math></inline-formula> is also equipped with a novel dynamic load balancing scheme whose main focus is on reducing the overhead of thread synchronization. Experimental results on widely used real datasets show that, on average, <inline-formula> <tex-math notation="LaTeX">${\sf HGED}$ </tex-math></inline-formula> outperforms the state-of-the art serial algorithm <inline-formula> <tex-math notation="LaTeX">${\sf AStar}^{+}$ </tex-math></inline-formula>-<inline-formula> <tex-math notation="LaTeX">${\sf LSa}$ </tex-math></inline-formula> by 6 times and the state-of-the parallel algorithm <inline-formula> <tex-math notation="LaTeX">${\sf PGED}$ </tex-math></inline-formula> by 4 times.