Abstract
The goal of this project is the study of Combinatorial OptimizationProblems related to subgraph isomorphism and some of its practicalapplications. In particular, we are interested in the investigation ofthe "Maximum Common Subgraph" (MCS) and the "Optimal DatapathMerging" (DPM) problems. In the MCS one looks for a largestsubgraph that iscommon to all elements of a give…