Finding groups of friends in social network data I have some social network data in which I'd like to identify people who belong to a group of 5 friends.  These are users who are friends with 4 other people who all are also friends with each other.

In the graph sense, this task involves identifying components of the graph where each node has an edge between every other node in the component and where the component contains at least 5 nodes.

Is there a well known algorithm to do this?  I was looking at measures like centrality, clustering coefficients, and strongly connected components but none of those are quite what I want.

Thanks!
Community Detection and Clique Percolation:

This is a community detection problem.  Here is a very detailed review article surveying the state of the art.

The Clique Percolation Method is also useful to explore as it pretty much solves what you may need to know.  You can also go through what Matching is, and link the concept with Blossom Algorithm. Though, this finds the maximum matching, you may slightly modify the algorithm to get the minimum matchings of 5 at least.