{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:51:34Z","timestamp":1743079894180,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319914510"},{"type":"electronic","value":"9783319914527"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","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-91452-7_12","type":"book-chapter","created":{"date-parts":[[2018,5,12]],"date-time":"2018-05-12T06:43:19Z","timestamp":1526107399000},"page":"169-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["K-Connected Cores Computation in Large Dual Networks"],"prefix":"10.1007","author":[{"given":"Lingxi","family":"Yue","sequence":"first","affiliation":[]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Lizhen","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Yongqing","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,13]]},"reference":[{"unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS, pp. 41\u201350 (2006)","key":"12_CR1"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithms 34(2), 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. arXiv preprint arXiv:cs\/0310049 (2003)","key":"12_CR3"},{"doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gullo, F., Kaltenbrunner, A., Volkovich, Y.: Core decomposition of uncertain graphs. In: KDD, pp. 1316\u20131325 (2014)","key":"12_CR4","DOI":"10.1145\/2623330.2623655"},{"doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: SIGMOD, pp. 205\u2013216 (2013)","key":"12_CR5","DOI":"10.1145\/2463676.2465323"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: ICDE, pp. 51\u201362 (2011)","key":"12_CR7","DOI":"10.1109\/ICDE.2011.5767911"},{"doi-asserted-by":"crossref","unstructured":"Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: KDD, pp. 1082\u20131090 (2011)","key":"12_CR8","DOI":"10.1145\/2020408.2020579"},{"doi-asserted-by":"crossref","unstructured":"Conte, A., Firmani, D., Mordente, C., Patrignani, M., Torlone, R.: Fast enumeration of large k-plexes. In: KDD, pp. 115\u2013124 (2017)","key":"12_CR9","DOI":"10.1145\/3097983.3098031"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1080\/00018732.2011.572452","volume":"60","author":"L da Fontoura Costa","year":"2011","unstructured":"da Fontoura Costa, L., Oliveira Jr., O.N., Travieso, G., Rodrigues, F.A., Boas, P.R.V., Antiqueira, L., Viana, M.P., Rocha, L.E.C.: Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Adv. Phys. 60(3), 329\u2013412 (2011)","journal-title":"Adv. Phys."},{"doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: SIGMOD, pp. 991\u20131002 (2014)","key":"12_CR11","DOI":"10.1145\/2588555.2612179"},{"issue":"12","key":"12_CR12","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":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: D-cores: measuring collaboration of directed graphs based on degeneracy. In: ICDM, pp. 201\u2013210 (2011)","key":"12_CR14","DOI":"10.1109\/ICDM.2011.46"},{"doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: Evaluating cooperation in communities with the k-core structure. In: ASONAM, pp. 87\u201393 (2011)","key":"12_CR15","DOI":"10.1109\/ASONAM.2011.65"},{"issue":"1\u20132","key":"12_CR16","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/rsa.20147","volume":"30","author":"S Janson","year":"2007","unstructured":"Janson, S., Luczak, M.J.: A simple solution to the k-core problem. Random Struct. Algorithms 30(1\u20132), 50\u201362 (2007)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"12_CR17","first-page":"13","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Barsky, M., Srinivasan, V., Thomo, A.: K-core decomposition of large networks on a single PC. PVLDB 9(1), 13\u201323 (2015)","journal-title":"PVLDB"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. TKDD 1(1), 2 (2007)","journal-title":"TKDD"},{"issue":"5","key":"12_CR19","first-page":"509","volume":"8","author":"R-H Li","year":"2015","unstructured":"Li, R.-H., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. PVLDB 8(5), 509\u2013520 (2015)","journal-title":"PVLDB"},{"issue":"10","key":"12_CR20","first-page":"2453","volume":"26","author":"R-H Li","year":"2014","unstructured":"Li, R.-H., Yu, J.X., Mao, R.: Efficient core maintenance in large dynamic graphs. TKDE 26(10), 2453\u20132465 (2014)","journal-title":"TKDE"},{"issue":"1","key":"12_CR21","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0012-365X(91)90162-U","volume":"91","author":"T \u0141uczak","year":"1991","unstructured":"\u0141uczak, T.: Size and connectivity of the k-core of a random graph. Discrete Math. 91(1), 61\u201368 (1991)","journal-title":"Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Ma, H., Zhou, D., Liu, C., Lyu, M.R., King, I.: Recommender systems with social regularization. In: Proceedings of the fourth ACM International Conference on Web Search and Data Mining, pp. 287\u2013296 (2011)","key":"12_CR22","DOI":"10.1145\/1935826.1935877"},{"doi-asserted-by":"crossref","unstructured":"Massa, P., Avesani, P.: Trust-aware recommender systems. In: RecSys, pp. 17\u201324 (2007)","key":"12_CR23","DOI":"10.1145\/1297231.1297235"},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/rsa.20061","volume":"27","author":"M Molloy","year":"2005","unstructured":"Molloy, M.: Cores in random hypergraphs and Boolean formulas. Random Struct. Algorithms 27(1), 124\u2013135 (2005)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"12_CR25","first-page":"288","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., De Pellegrini, F., Miorandi, D.: Distributed k-core decomposition. TPDS 24(2), 288\u2013300 (2013)","journal-title":"TPDS"},{"doi-asserted-by":"crossref","unstructured":"OBrien, M.P., Sullivan, B.D.: Locally estimating core numbers. In: ICDM, pp. 460\u2013469 (2014)","key":"12_CR26","DOI":"10.1109\/ICDM.2014.136"},{"issue":"1","key":"12_CR27","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jctb.1996.0036","volume":"67","author":"B Pittel","year":"1996","unstructured":"Pittel, B., Spencer, J., Wormald, N.: Sudden emergence of a giantk-core in a random graph. J. Comb. Theory Ser. B 67(1), 111\u2013151 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"6","key":"12_CR28","first-page":"433","volume":"6","author":"AE Sar\u00edy\u00fcce","year":"2013","unstructured":"Sar\u00edy\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.-L., \u00c7ataly\u00fcrek, \u00dc.V.: Streaming algorithms for k-core decomposition. PVLDB 6(6), 433\u2013444 (2013)","journal-title":"PVLDB"},{"issue":"3","key":"12_CR29","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. Social Netw. 5(3), 269\u2013287 (1983)","journal-title":"Social Netw."},{"doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: Arnetminer: extraction and mining of academic social networks. In: KDD, pp. 990\u2013998 (2008)","key":"12_CR30","DOI":"10.1145\/1401890.1402008"},{"issue":"9","key":"12_CR31","first-page":"812","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB 5(9), 812\u2013823 (2012)","journal-title":"PVLDB"},{"doi-asserted-by":"crossref","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J.X.: I\/o efficient core graph decomposition at web scale. In: ICDE, pp. 133\u2013144. IEEE (2016)","key":"12_CR32","DOI":"10.1109\/ICDE.2016.7498235"},{"doi-asserted-by":"crossref","unstructured":"Wu, Y., Jin, R., Zhu, X., Zhang,X.: Finding dense and connected subgraphs in dual networks. In: ICDE, pp. 915\u2013926 (2015)","key":"12_CR33","DOI":"10.1109\/ICDE.2015.7113344"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91452-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:14:25Z","timestamp":1709831665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91452-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319914510","9783319914527"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91452-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ict.griffith.edu.au\/conferences\/dasfaa2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}