Maximum common subgraph

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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

This set index article includes a list of related items that share the same name (or similar names).
If an internal link incorrectly led you here, you may wish to change the link to point directly to the intended article.