{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:55:56Z","timestamp":1743112556264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687827"},{"type":"electronic","value":"9783319687834"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","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":[[2017]]},"DOI":"10.1007\/978-3-319-68783-4_30","type":"book-chapter","created":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T05:08:32Z","timestamp":1507007312000},"page":"441-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Discovering Hierarchical Subgraphs of\u00a0K-Core-Truss"],"prefix":"10.1007","author":[{"given":"Zhen-jun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Peng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,4]]},"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: Advances in neural information processing systems (2005)","key":"30_CR1"},{"issue":"6","key":"30_CR2","doi-asserted-by":"publisher","first-page":"574","DOI":"10.14778\/2168651.2168658","volume":"5","author":"A Angel","year":"2012","unstructured":"Angel, A., Sarkas, N., Koudas, N., Srivastava, D.: Dense subgraph maintenance under streaming edge weight updates for real-time story identification. Proc. VLDB Endow. 5(6), 574\u2013585 (2012)","journal-title":"Proc. VLDB Endow."},{"unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. CoRR cs.DS\/0310049 (2003)","key":"30_CR3"},{"doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: WSDM (2008)","key":"30_CR4","DOI":"10.1145\/1341531.1341547"},{"doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: ICDE (2011)","key":"30_CR5","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"5","key":"30_CR6","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: WWW (2007)","key":"30_CR7","DOI":"10.1145\/1242572.1242635"},{"issue":"14","key":"30_CR8","doi-asserted-by":"publisher","first-page":"e150","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin, E., Naughton, B.T., Brutlag, D.L., Batzoglou, S.: MotifCut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14), e150\u2013e157 (2006)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. SIGMOD (2014)","key":"30_CR9","DOI":"10.1145\/2588555.2610495"},{"issue":"4","key":"30_CR10","doi-asserted-by":"publisher","first-page":"276","DOI":"10.14778\/2856318.2856323","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang, X., Lakshmanan, L.V., Yu, J.X., Cheng, H.: Approximate closest community search in networks. Proc. VLDB Endow. 9(4), 276\u2013287 (2015)","journal-title":"Proc. VLDB Endow."},{"doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-HOP: a high-compression indexing scheme for reachability query. In: SIGMOD (2009)","key":"30_CR11","DOI":"10.1145\/1559845.1559930"},{"doi-asserted-by":"crossref","unstructured":"Lee, P., Lakshmanan, L.V.S., Milios, E.: CAST: a context-aware story-teller for streaming socail content. In: CIKM (2014)","key":"30_CR12","DOI":"10.1145\/2661829.2661859"},{"issue":"2","key":"30_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11704-013-3902-8","volume":"7","author":"R Li","year":"2013","unstructured":"Li, R., Liu, J., Yu, J.X., Chen, H., Kitagawa, H.: Co-occurrence prediction in a large location-based social network. Front. Comput. Sci. 7(2), 185\u2013194 (2013)","journal-title":"Front. Comput. Sci."},{"issue":"5","key":"30_CR14","doi-asserted-by":"publisher","first-page":"509","DOI":"10.14778\/2735479.2735484","volume":"8","author":"R Li","year":"2015","unstructured":"Li, R., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. Proc. VLDB Endow. 8(5), 509\u2013520 (2015)","journal-title":"Proc. VLDB Endow."},{"doi-asserted-by":"crossref","unstructured":"Li, R., Qin, L., Yu, J.X., Mao, R.: Efficient and progressive group steiner tree search. In: SIGMOD (2016)","key":"30_CR15","DOI":"10.1145\/2882903.2915217"},{"doi-asserted-by":"crossref","unstructured":"Li, R., Qin, L., Yu, J.X., Mao, R.: Finding influential communities in massive networks. VLDB J. (2017)","key":"30_CR16","DOI":"10.1007\/s00778-017-0467-4"},{"issue":"10","key":"30_CR17","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"R Li","year":"2014","unstructured":"Li, R., Yu, J.X., Mao, R.: Efficient core maintenance in large dynamic graphs. IEEE Trans. Knowl. Data Eng. 26(10), 2453\u20132465 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"30_CR18","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., Pellegrini, F.D., Miorandi, D.: Distributed k-core decomposition. IEEE Trans. Parallel Distrib. Syst. 24(2), 288\u2013300 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"crossref","unstructured":"Qin, L., Li, R., Chang, L., Zhang, C.: Locally densest subgraph discovery. In: KDD, pp. 965\u2013974 (2015)","key":"30_CR19","DOI":"10.1145\/2783258.2783299"},{"doi-asserted-by":"crossref","unstructured":"Sariyuce, A.E., Seshadhri, C., Pinar, A., Catalyurek, U.V.: Finding the hierarchy of dense subgraphs using nucleus decompositions. In: WWW (2015)","key":"30_CR20","DOI":"10.2172\/1172917"},{"issue":"3","key":"30_CR21","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":"5","key":"30_CR22","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TKDE.2015.2509998","volume":"28","author":"S Shang","year":"2016","unstructured":"Shang, S., Chen, L., Wei, Z., Jensen, C.S., Wen, J.R., Kalnis, P.: Collective travel planning in spatial networks. IEEE Trans. Knowl. Data Eng. 28(5), 1132\u20131146 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"30_CR23","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00778-013-0331-0","volume":"23","author":"S Shang","year":"2014","unstructured":"Shang, S., Ding, R., Zheng, K., Jensen, C.S., Kalnis, P., Zhou, X.: Personalized trajectory matching in spatial networks. VLDB J. \u0142 Int. J. Very Large Data Bases 23(3), 449\u2013468 (2014)","journal-title":"VLDB J. \u0142 Int. J. Very Large Data Bases"},{"issue":"9","key":"30_CR24","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/2311906.2311909","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. Proc. VLDB Endow. 5(9), 812\u2013823 (2012)","journal-title":"Proc. VLDB Endow."},{"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 (2016)","key":"30_CR25","DOI":"10.1109\/ICDE.2016.7498235"},{"doi-asserted-by":"crossref","unstructured":"Zheng, D., Liu, J., Li, R., Aslay, \u00c7., Chen, Y., Huang, X.: Querying intimate-core groups in weighted graphs. In: 11th IEEE International Conference on Semantic Computing, ICSC 2017, San Diego, CA, USA, 30 January\u20131 February 2017 (2017)","key":"30_CR26","DOI":"10.1109\/ICSC.2017.80"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68783-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:58:30Z","timestamp":1710266310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-68783-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687827","9783319687834"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68783-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"4 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puschino","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wise-conferences.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}