Skip to Main Content
A system for efficient team formation in social networks is demonstrated. Given a project whose completion requires a set of skills, our system finds a set of experts that together have all of the required skills and also have the minimal communication cost. The system finds the best teams with or without a leader using two types of communication structures. After discovering the teams of experts, our system can display the relationships among the experts in a team by showing how the experts are connected in the social network. Since the total number of teams might be exponential with respect to the number of required skills, procedures that produce top-k teams of experts with or without a leader in polynomial delay are implemented. The system is demonstrated using the well-known DBLP dataset.