The community-search problem and how to plan a successful cocktail party
This paper is the first paper that propose the problem of community search. Keywords: $k$-core; Undirected graph; Size-constraints; Greedy algorithm; Heuristic Algorithms 1 Motivations Discovering communities in graphs and social networks has drawn a large amount of attention in recent years. Most of the work has focused on the scenario where communities need to be discovered in an a priori manner, with only reference to the input graph. However, in many application scenarios, we are interested in discovering the community defined by a given set of nodes. ...