Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Keyboard shortcuts
h, / search box
j, ↓ next result
k, ↑ prev result
l, o, Enter go
More...
Ctrl+Enter bg
', v new tab
d domain search
t Top
!, 1 !bang dropdown
esc out of bangs
s Did you mean
r related topics
m main results
More explanation...
Subgraph isomorphism problem
In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H.
More at Wikipedia
Induced subgraph isomorphism problem
Maximum common subgraph isomorphism problem
More related topics
Computational problems in graph theory
NP-complete problems
Graph algorithms
This page requires Javascript.Get the non-JS version
here
.