@nishit whats the problem with Bipartite Matching ist perfect example of Bipartite Graph isn't it ?? as have to just divide the set of vertex in to two disjoint set such that no two people who are friends will be in same team & that what Bipartite Matching says ??
although graph coloring will also work here as u said in last we have to return all the nodes in even level & odd leve by combining into two disjoints set ..it will be automatically disjoints .. Shashank Mani CSE, BIT Mesra -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
