#maximum_common_subgraph
Maximum common subgraph
Index of articles associated with the same name
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
Mon 8th
Provided by Wikipedia
This keyword could refer to multiple things. Here are some suggestions:
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.