Describe the problem as a graph problem. I've tried to modify the breadth first search algorithm, but haven't gotten anywhere. Any ideas?
Consider a social network. The goal is to find in the in the network a largest group of people who are all friends with each other.
graphs