, the maximum common edge subgraph problem is the problem of finding a graph
The maximum common edge subgraph problem on general graphs is NP-complete as it is a generalization of subgraph isomorphism: a graph
if and only if the maximum common edge subgraph of
The problem is APX-hard, unless the two input graphs
This algorithms or data structures-related article is a stub.
You can help Wikipedia by expanding it.This graph theory-related article is a stub.