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₂? Sometimes also name subgraph matching is used for the same problem. This name puts emphasis on finding such a subgraph and is not a bare decision problem.

<< Previous

Word Browser

Next >>

the korea times
b. t. roberts
sankei sports
egyptian theatre
ginseng
sichuan ribao
mariel boatlift
sankei shimbun
james martin
blackstone river
hokkaido shimbun

shizuoka shimbun
spiritualized
church of the sacred heart
defensive lineman
riders in the sky
rickenbacker international airport
spring arbor university
molecular beam epitaxy
habitat for humanity
hms argyll (f231)
yakima sun kings

list of governors general of mauritius
list of presidents of mauritius
heads of state of mozambique
central christian college
colleen fitzpatrick
list of presidents of namibia
dalton highway
list of presidents of niger
list of governors general of nigeria
list of presidents of nigeria
douglas skyrocket

dolby laboratories
list of kings of rwanda
list of presidents of rwanda
divorce act, 1968 (canada)
list of presidents of so tom and prncipe
list of grape varieties
list of presidents of senegal
list of presidents of seychelles
uss houston (cl 81)
list of governors general of sierra leone
little saigon