maximum common subgraph
Description: A maximum common subgraph is a largest subgraph shared by two or more graphs, a problem studied in graph theory and computing.
Primary topic: Graph Theory and Algorithms (47%)
Wikidata ID: wiki/Q115927373
OpenAlex ID: keywords/maximum-common-subgraph
