Maximum common subgraph

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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