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

📚 Artikel Terkait di Wikipedia

Subgraph isomorphism problem

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

Maximum common edge subgraph

Subgraph isomorphism problem Induced subgraph isomorphism problem de Gastines, Etienne; Knippel, Arnaud (2024), "Formulations for the maximum common edge

List of NP-complete problems

(especially with weighted edges) maximum cut. Maximum common subgraph isomorphism problem Maximum independent set Maximum Induced path Minimum maximal independent

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

List of unsolved problems in mathematics

that a graph with maximum degree Δ ( G ) ≥ n / 3 {\displaystyle \Delta (G)\geq n/3} is class 2 if and only if it has an overfull subgraph S {\displaystyle

Forbidden subgraph problem

In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph G {\displaystyle G} , find the maximal number of edges

NP-completeness

Knapsack problem Hamiltonian path problem Travelling salesman problem (decision version) Subgraph isomorphism problem Subset sum problem Clique problem Vertex

Clique problem

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