The community-search problem and how to plan a successful cocktail party
作者： Mauro Sozio , Aristides Gionis
关键词:
摘要: … set of skills to be satisfied, we are required to find a subgraph in which all skills are present … As we will see in Section 4 the constraint to satisfy a set of skills is monotone, and therefore, …
mpg.de
core.ac.uk
acm.org
sci-hub.se 
researchgate.net 参考文章(30)
Padhraic Smyth, Scott White, A Spectral Clustering Approach To Finding Communities in Graph. siam international conference on data mining. pp. 274- 285 ,(2005)
Samir Khuller, Barna Saha, On Finding Dense Subgraphs Automata, Languages and Programming. pp. 597- 608 ,(2009) , 10.1007/978-3-642-02927-1_50
J. Hastad, Clique is hard to approximate within n/sup 1-/spl epsiv// foundations of computer science. pp. 627- 636 ,(1996) , 10.1109/SFCS.1996.548522
Moses Charikar, Greedy approximation algorithms for finding dense components in a graph Lecture Notes in Computer Science. pp. 84- 95 ,(2000) , 10.1007/3-540-44436-X_10
Jens Vygen, Bernhard Korte, Combinatorial Optimization: Theory and Algorithms ,(2012)
Petteri Sevon, Lauri Eronen, Petteri Hintsanen, Kimmo Kulovesi, Hannu Toivonen, Link discovery in graphs derived from biological databases data integration in the life sciences. pp. 35- 49 ,(2006) , 10.1007/11799511_5
Andrew Tomkins, David Gibson, Ravi Kumar, Discovering large dense subgraphs in massive graphs very large data bases. pp. 721- 732 ,(2005)
Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama, Greedily Finding a Dense Subgraph scandinavian workshop on algorithm theory. pp. 136- 148 ,(1996) , 10.1007/3-540-61422-2_127
Reid Andersen, Kumar Chellapilla, Finding Dense Subgraphs with Size Bounds workshop on algorithms and models for the web graph. pp. 25- 37 ,(2009) , 10.1007/978-3-540-95995-3_3
M. Girvan, M. E. J. Newman, Community structure in social and biological networks Proceedings of the National Academy of Sciences of the United States of America. ,vol. 99, pp. 7821- 7826 ,(2002) , 10.1073/PNAS.122653799