That problem is called "subgraph isomorphism" and it is NP-complete (and so likely to be hard). Do you need a general solution for this, or just for a particular graph G? The second case is much easier.
There is some general information about algorithms here. There is a version of one of the algorithms (actually, for a more general problem) in the Boost Graph Library (see documentation here).
1 for being first and citing a 1993 thread on the matter :) – phooji Mar 11 at 23:45 @phooji: A lot of the results haven't changed, most likely; I know Nauty is still used, at least, though I've heard of it from the full graph isomorphism problem. The algorithm I mention from my edit is from 1982. – Jeremiah Willcock Mar 11 at 23:47 @Jeremiah Willcock: 1993... 1982... what's next?1971?
;) – phooji Mar 11 at 23:51 I need a general algorithm for graph isomorphism problem – fayza Mar 12 at 0:02 @fayza: Graph isomorphism or subgraph isomorphism? – Jeremiah Willcock Mar 12 at 0:11.
A general answer for a general question: the problem you want to solve is known as 'subgraph isomorphism. ' Have a look here for further references: en.wikipedia.org/wiki/Subgraph_isomorphi... .
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.