A Parallel Framework for the Maximum Common Induced Subgraph Problem
TL;DR
A parallel MCIS framework integrating a dynamic task decomposition method guided by search information and a novel pruning strategy based on shared information is proposed, which achieves superior performance over both state-of-the-art sequential and existing parallel algorithms.
Abstract
Finding the maximum common induced subgraph (MCIS) between two graphs is a well-known NP-hard problem. While sequential MCIS algorithms have been extensively studied, parallel computing has emerged as an important direction for further performance enhancement with the advancement of computing resources. In this paper, we propose a parallel MCIS framework integrating a dynamic task decomposition method guided by search information and a novel pruning strategy based on shared information. The experimental results demonstrate that the algorithm enhanced by our framework achieves superior performance over both state-of-the-art sequential and existing parallel algorithms. Extensive results further demonstrate the wide scalability and generality of our framework, and the effectiveness of our strategies.