Reduction Algorithm - Recast Any SGI Problem as Subset Sum

Is it possible to cast any subgraph isomorphism problem as a subset sum problem so that it is possible to use dynamic programming techniques av开发者_如何学Goailable for solving the subset sum problem to solve the SGI problem?

Yes, you could do it, but every reduction known would produce a subset-sum problem with exponentially large numbers.

(Also, btilly, your homework detector is broken.)

I don't see how this could be done. There's no immediately clear mapping between the weights of the subset-sum problem and the structure of the graph. The only relation between the two problems would be the subset of the graph and the subset of the set in the subset-sum problem. The pseudo-polytime (dynamic programming) algorithm for subset-sum operates over a set of digits and a bounded sum - I seriously doubt there's any way to encode the structure of the graph in this format. But, given that this is a homework problem, I might be wrong :)