Keywords

#maximum_common_edge_subgraph

Maximum common edge subgraph

Given two graphs and , the maximum common edge subgraph problem is the problem of finding a graph with as many edges as possible which is isomorphic to both a subgraph of and a subgraph of .

Mon 22nd

Provided by Wikipedia

Learn More

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

Maximum common edge subgraph Maximum common subgraph Maximum common induced subgraph Subgraph isomorphism problem Glossary of graph theory Edge coloring Maximum cut Clique problem Line graph Independent set (graph theory)
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.