English Maximum common induced subgraph Cited by user JamesTrimble on 16 Jun 2021 In graph theory and theoretical computer science, a maximum common induced subgraph of two graphs G and H is a graph that is an induced subgraph of both G and H, and…