A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs

Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connected induced subgraphs of the input graphs. Experimental results are provided.

• Type: Conference
• Year: 2005
• Where: GBRPR
• Authors: Bertrand Cuissart, Jean-Jacques Hébrard
• Keywords: Connected Induced Subgraphs, Direct Algorithm, GBRPR 2005, Input Graphs