2005 | OriginalPaper | Chapter
A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs
Authors : Bertrand Cuissart, Jean-Jacques Hébrard
Published in: Graph-Based Representations in Pattern Recognition
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.