{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:51Z","timestamp":1740099051239,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319920122"},{"type":"electronic","value":"9783319920139"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92013-9_18","type":"book-chapter","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T12:57:09Z","timestamp":1526561829000},"page":"224-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Maximal Stable Cores in Social Networks"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"key":"18_CR1","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049 (2003)"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1137\/14097032X","volume":"29","author":"K Bhawalkar","year":"2015","unstructured":"Bhawalkar, K., Kleinberg, J., Lewi, K., Roughgarden, T., Sharma, A.: Preventing unravelling in social networks: the anchored k-core problem. SIAM J. Discrete Math. 29(3), 1452\u20131475 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"9","key":"18_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"2006","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (2006)","journal-title":"Commun. ACM"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: KDD, pp. 1240\u20131348 (2012)","DOI":"10.1145\/2339530.2339724"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20662-7_31","volume-title":"Experimental Algorithms","author":"D Eppstein","year":"2011","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 364\u2013375. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_31"},{"issue":"12","key":"18_CR6","first-page":"1233","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. PVLDB 9(12), 1233\u20131244 (2016)","journal-title":"PVLDB"},{"issue":"5","key":"18_CR7","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1177\/0165551514541614","volume":"40","author":"Y Fang","year":"2014","unstructured":"Fang, Y., Zhang, H., Ye, Y., Li, X.: Detecting hot topics from twitter: a multiview approach. J. Inf. Sci. 40(5), 578\u2013593 (2014)","journal-title":"J. Inf. Sci."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Goldberg, M.K., Kelly, S., Magdon-Ismail, M., Mertsalov, K., Wallace, A.: Finding overlapping communities in social networks. In: SocialCom\/PASSAT, pp. 104\u2013113 (2010)","DOI":"10.1109\/SocialCom.2010.24"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Hristova, D., Musolesi, M., Mascolo, C.: Keep your friends close and your facebook friends closer: a multiplex network approach to the analysis of offline and online social ties. In: ICWSM (2014)","DOI":"10.1609\/icwsm.v8i1.14544"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, W., Lakshmanan, L.V.S.: Truss decomposition of probabilistic graphs: semantics and algorithms. In: SIGMOD, pp. 77\u201390 (2016)","DOI":"10.1145\/2882903.2882913"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"1","key":"18_CR12","first-page":"13","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Barsky, M., Srinivasan, V., Thomo, A.: K-core deomposition of large networks on a single PC. PVLDB 9(1), 13\u201323 (2015)","journal-title":"PVLDB"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J., Fi, A.W.: Redundancy-aware maximal cliques. In: KDD, pp. 122\u2013130 (2013)","DOI":"10.1145\/2487575.2487689"},{"issue":"6","key":"18_CR14","first-page":"649","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, W., Zhang, Y., Qin, L., Lin, X.: OLAK: an efficient algorithm to prevent unravelling in social networks. PVLDB 10(6), 649\u2013660 (2017)","journal-title":"PVLDB"},{"issue":"10","key":"18_CR15","first-page":"998","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: When engagement meets similarity: efficient (k, r)-core computation on social networks. PVLDB 10(10), 998\u20131009 (2017)","journal-title":"PVLDB"},{"key":"18_CR16","unstructured":"Zhu, Q., Hu, H., Xu, J., Lee, W.: Geo-social group queries with minimum acquaintance constraint. CoRR, abs\/1406.7367 (2014)"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92013-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T17:58:36Z","timestamp":1693677516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92013-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319920122","9783319920139"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92013-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}