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

📚 Artikel Terkait di Wikipedia

Maximum common edge subgraph

G'} , the maximum common edge subgraph problem (or MCES problem) is the problem of finding a graph H {\displaystyle H} with as many edges as possible

Maximum common induced subgraph

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

Subgraph isomorphism problem

{\displaystyle G} contains a subgraph that is isomorphic to H {\displaystyle H} . Subgraph isomorphism is a generalization of both the maximum clique problem and

Glossary of graph theory

lines or edges. Contents:  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z See also References Square brackets [ ] G[S] is the induced subgraph of a graph

Maximum cut

of edges between S and the complementary subset is as large as possible. Equivalently, one wants a bipartite subgraph of the graph with as many edges as

Graph theory

Harary and Palmer (1973). A common problem, called the subgraph isomorphism problem, is finding a fixed graph as a subgraph in a given graph. One reason

Clique problem

reduce the problem of finding the maximum common induced subgraph of two graphs to the problem of finding a maximum clique in their product. In automatic

Matching (graph theory)

is the edge set of an induced subgraph. Given a matching M, an alternating path is a path that begins with an unmatched vertex and whose edges belong