Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries

TL;DR

This paper presents a novel dual-symmetry breaking framework that significantly accelerates maximum common subgraph computations by effectively exploiting symmetries in both variable and value graphs, leading to improved performance.

Contribution

It introduces a complete symmetry-breaking method that handles symmetries in both graphs, enhancing search efficiency in MCS algorithms.

Findings

Outperforms the RRSplit algorithm on standard benchmarks.

Reduces computation time and search space substantially.

Solves more instances than previous methods.

Abstract

The Maximum Common Subgraph (MCS) problem plays a key role in many applications, including cheminformatics, bioinformatics, and pattern recognition, where it is used to identify the largest shared substructure between two graphs. Although symmetry exploitation is a powerful means of reducing search space in combinatorial optimization, its potential in MCS algorithms has remained largely underexplored due to the challenges of detecting and integrating symmetries effectively. Existing approaches, such as RRSplit, partially address symmetry through vertex-equivalence reasoning on the variable graph, but symmetries in the value graph remain unexploited. In this work, we introduce a complete dual-symmetry breaking framework that simultaneously handles symmetries in both variable and value graphs. Our method identifies and exploits modular symmetries based on local neighborhood structures, allowing the algorithm to prune isomorphic subtrees during search while rigorously preserving optimality. Extensive experiments on standard MCS benchmarks show that our approach substantially outperforms the state-of-the-art RRSplit algorithm, solving more instances with significant reductions in both computation time and search space. These results highlight the practical effectiveness of comprehensive symmetry-aware pruning for accelerating exact MCS computation.