	community	directory	books	authors	images	encyclopedia

Email:
Password:
Register

Knowledgerush Search

Search for images of Subgraph isomorphism problem

Message boards Post comment

Subgraph isomorphism problem

In complexity theory, Subgraph-Isomorphism is a decision problem that is known to be NP-complete. The formal description of the decision problem is as follows.

Subgraph-Isomorphism(G₁, G₂)
Input: Two graphs G₁ and G₂.
Question: Is G₁ isomorphic to a subgraph of G₂?

Referenced By

NP-Complete | NP-complete problem | NP-complete problems | NP-completeness

Compose Your Message

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Subgraph isomorphism problem".