I am trying to find an algorithm to find the sub graphs in a undirected connected graph, where each vertex in the subgraph has an edge to every other vertex in the subgraph.
My real problem is that I am having trouble classifying this problem, so that I can research possible algorithms or solutions.
Would anyone know what this problem is called or is there any existing algorithms that achieve this?
I believe that you are referring to the Clique problem.