algorithm - Divide people into teams for most satisfaction -

Just remember a query when professor in class group work has a certain number of people ( n ) Will split into groups?

Some of my professors will have a list of n , people want to work with one and students do not want to work with anyone. , And then magically change the group of n , where students will be matched with the people they like and avoid working with people whom they do not like.

For me, this algorithm sounds like an impotent problem, but I thought what I would say about your approach to this kind of problem.

Edit : I got a description of something exactly like my question. Read the second paragraph for Dja V.

This seems like a sort of problem for me.

By the way I will be linked to two students if some of the following are:

1. At least one student works with another Wants to
2. None of the two students want to work with others.

Then it is a matter of dividing the graph into shape n group. Assuming the number of students (divisible by n)

If this was not possible, then I would probably put the first hurdle on the slip, and do not let the edges between two people clearly say that They do not want to work with others.

I have no information about an approach to solve this method efficiently, but it should take you closer to some insights of this problem. / P>