Fundamental Study Enumerating all connected maximal common subgraphs in two graphs

We represent a new method for nding all connected maximal common subgraphs in two graphs which is based on the transformation of the problem into the clique problem. We have developed new algorithms for enumerating all cliques that represent connected maximal common subgraphs. These algorithms are based on variants of the Bron{Kerbosch algorithm. In this paper we explain the transformation of the maximal common subgraph problem into the clique problem. We give a short summary of the variants of the Bron{Kerbosch algorithm in order to explain the modication of that algorithm such that the detected cliques represent connected maximal common subgraphs. After introducing and proving several variants of the modied algorithm we discuss the runtimes for all variants by means of random graphs. The results show the drastical reduction of the runtimes for the new algorithms. c 2001 Elsevier Science B.V. All rights reserved.