Subgraph isomorphism [closed]?

If you had spent five minutes reading e.g. The Wikipedia article on subgraph isomorphism, you would have discovered that there is an algorithm due to Ullmann for solving the problem. Also, since the problem is NP-complete, a straight-forward brute force algorithm (try every possible way of matching each node in T with a node in G) would probably also be acceptable.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.