• Science • People
Non User
 • Locations • Timeline
Index: 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

Home > 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(G1, G2)
Input: Two graphs G1 and G2.
Question: Is G1 isomorphic to a subgraph of G2?



Read more »

Topics: Subgraph Isomorphism Problem, Guides, Tutorials...

Subgraph isomorphism problemIn 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 o  
Non User