Article · Wikipedia archive · Last revised May 31, 2026

Maximum common subgraph

In graph theory and theoretical computer science, a maximum common subgraph may mean either:Maximum common induced subgraph, a graph that is an induced subgraph of two given graphs and has as many vertices as possible Maximum common edge subgraph, a graph that is a subgraph of two given graphs and has as many edges as possible

Last revised

May 31, 2026

Read time

≈ 1 min

Length

57 w

Citations

—

Source

In graph theory and theoretical computer science, a maximum common subgraph may mean either:

Maximum common induced subgraph, a graph that is an induced subgraph of two given graphs and has as many vertices as possible
Maximum common edge subgraph, a graph that is a subgraph of two given graphs and has as many edges as possible