Query Optimal k-Plex Based Community in Graphs
Tóm tắt
Từ khóa
Tài liệu tham khảo
Agarwal G, Kempe D (2008) Modularity-maximizing graph communities via mathematical programming. Eur Phys J B 66(3):409–418
Andersen R, Chellapilla K (2009) Finding dense subgraphs with size bounds. In: Proceedings of algorithms and models for the web-graph, 6th international workshop, WAW 2009, Barcelona, Spain, February 12–13, 2009, pp 25–37
Balasundaram B, Butenko S, Hicks IV (2011) Clique relaxations in social network analysis: the maximum k-plex problem. Oper Res 59(1):133–142
Barbieri N, Bonchi F, Galimberti E, Gullo F (2015) Efficient and effective community search. Data Min Knowl Discov 29(5):1406–1433
Batagelj V, Zaversnik M (2003) An O (m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049
Berlowitz D, Cohen S, Kimelfeld B (2015) Efficient enumeration of maximal k-plexes. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, Melbourne, Victoria, Australia, May 31–June 4, 2015, pp 431–444
Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z, Wagner D (2008) On modularity clustering. IEEE Trans Knowl Data Eng 20(2):172–188
Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575–577
Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph. In: Proceedings of approximation algorithms for combinatorial optimization, third international workshop, APPROX 2000, Saarbrücken, Germany, September 5–8, 2000, pp 84–95
Cui W, Xiao Y, Wang H, Lu Y, Wang W (2013) Online search of overlapping communities. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, ACM, pp 277–288
Cui W, Xiao Y, Wang H, Wang W (2014) Local search of communities in large graphs. In: International conference on management of data, SIGMOD 2014, Snowbird, UT, USA, June 22–27, 2014, pp 991–1002
Fortunato S, Barthélemy M (2007) Resolution limit in community detection. Proc Nat Acad Sci 104(1):36–41
Goldberg AV (1984) Finding a maximum density subgraph. University of California, Berkeley, Berkeley
Håstad J (1999) Clique is hard to approximate within $$n^{1-\epsilon }$$ n 1 - ϵ . Acta Math 182(1):105–142
Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying k-truss community in large and dynamic graphs. In: International conference on management of data, SIGMOD 2014, Snowbird, UT, USA, June 22–27, 2014, pp 1311–1322
Huang X, Lakshmanan LVS, Yu JX, Cheng H (2015) Approximate closest community search in networks. PVLDB 9(4):276–287
Kannan R, Vinay V (1999) Analyzing the structure of large graphs. Rheinische Friedrich-Wilhelms-Universität Bonn, Bonn
Khuller S, Saha B (2009) On finding dense subgraphs. In: Proceedings of automata, languages and programming, 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5–12, 2009, Part I, pp 597–608
Li K, Lu W, Bhagat S, Lakshmanan LVS, Yu C (2014) On social event organization. In: The 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’14, New York, NY, USA, August 24–27, 2014, pp 1206–1215
Li R, Qin L, Yu JX, Mao R (2015) Influential community search in large networks. PVLDB 8(5):509–520
McDermott R (2000) Knowing in community. IHRIM 19
Newman ME (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066,133
Rowe L, Nadeau J, Turner R, Frankel W, Letts V, Eppig J, Ko M, Thurston S, Birkenmeier E (1994) Maps from two interspecific backcross dna panels available as a community genetic mapping resource. Mamm Genome 5(5):253–274
Seidman SB, Foster BL (1978) A graph-theoretic generalization of the clique concept. J Math Sociol 6(1):139–154
Song DM, Tumminello M, Zhou WX, Mantegna RN (2011) Evolution of worldwide stock markets, correlation structure, and correlation-based graphs. Phys Rev E 84(2):026,108
Sozio M, Gionis A (2010) The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 939–948
Tsourakakis C (2015) The k-clique densest subgraph problem. In: Proceedings of the 24th International Conference on World Wide Web, International World Wide Web Conferences Steering Committee, pp 1122–1132
Wu Y, Jin R, Li J, Zhang X (2015a) Robust local community detection: on free rider effect and its elimination. Proc VLDB Endow 8(7):798–809
Wu Y, Jin R, Li J, Zhang X (2015b) Robust local community detection: on free rider effect and its elimination. PVLDB 8(7):798–809
Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput Surv (csur) 45(4):43