Keywords

#maximum_common_induced_subgraph

Maximum common induced subgraph

In graph theory and theoretical computer science, a maximum common induced subgraph of two graphs G and H is a graph that is an induced subgraph of both G and H, and that has as many vertices as possible.

Mon 12th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Maximum common induced subgraph Maximum common subgraph Clique problem Maximum common edge subgraph Glossary of graph theory Maximum cut Modular product of graphs Subgraph isomorphism problem Graph theory Matching (graph theory)
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.