{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:05:15Z","timestamp":1777431915982,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402292"],"award-info":[{"award-number":["61402292"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1301252"],"award-info":[{"award-number":["U1301252"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s41019-018-0068-2","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T05:44:07Z","timestamp":1530596647000},"page":"136-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Discovering Hierarchical Subgraphs of K-Core-Truss"],"prefix":"10.1007","volume":"3","author":[{"given":"Zhenjun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunting","family":"Lu","sequence":"additional","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":[[2018,7,3]]},"reference":[{"key":"68_CR1","doi-asserted-by":"crossref","unstructured":"Sariyuce AE, Seshadhri C, Pinar A, Catalyurek UV (2015) Finding the hierarchy of dense subgraphs using nucleus decompositions. In: International Conference on World Wide Web ACM","DOI":"10.2172\/1172917"},{"issue":"9","key":"68_CR2","first-page":"812","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang J, Cheng J (2012) Truss decomposition in massive networks. PVLDB 5(9):812\u2013823","journal-title":"PVLDB"},{"key":"68_CR3","unstructured":"Huang X, Cheng H, Qin L, Tian W, Yu JX Querying k-truss community in large and dynamic graphs, SIGMOD"},{"issue":"5","key":"68_CR4","first-page":"509","volume":"8","author":"R Li","year":"2015","unstructured":"Li R, Qin L, Yu JX, Mao R (2015) Influential community search in large networks. PVLDB 8(5):509\u2013520","journal-title":"PVLDB"},{"issue":"4","key":"68_CR5","doi-asserted-by":"publisher","first-page":"276","DOI":"10.14778\/2856318.2856323","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang X, Lakshmanan LV, Yu JX, Cheng H (2015) Approximate closest community search in networks. Proc VLDB Endow 9(4):276\u2013287","journal-title":"Proc VLDB Endow"},{"key":"68_CR6","doi-asserted-by":"crossref","unstructured":"Buehrer G, Chellapilla K (2008) A scalable pattern mining approach to web graph compression with communities. In: Proceedings of the 2008 International Conference on Web Search and Data Mining, ACM, pp. 95\u2013106","DOI":"10.1145\/1341531.1341547"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Dourisboure Y, Geraci F, Pellegrini M (2007) Extraction and classification of dense communities in the web. In: Proceedings of the 16th international conference on World Wide Web, ACM, pp. 461\u2013470","DOI":"10.1145\/1242572.1242635"},{"issue":"6","key":"68_CR8","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 (2012) Dense subgraph maintenance under streaming edge weight updates for real-time story identification. Proc VLDB Endow 5(6):574\u2013585","journal-title":"Proc VLDB Endow"},{"key":"68_CR9","doi-asserted-by":"crossref","unstructured":"Lee P, Lakshmanan LVS, Milios E (2014) Cast:a context-aware story-teller for streaming socail content, In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management ACM","DOI":"10.1145\/2661829.2661859"},{"issue":"14","key":"68_CR10","doi-asserted-by":"publisher","first-page":"e150","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin E, Naughton BT, Brutlag DL, Batzoglou S (2006) Motifcut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14):e150\u2013e157","journal-title":"Bioinformatics"},{"key":"68_CR11","unstructured":"Alvarez-Hamelin JI, Dall\u2019Asta L, Barrat A, Vespignani A (2005) Large scale networks fingerprinting and visualization using the k-core decomposition. In: Advances in neural information processing systems, pp. 41\u201350"},{"issue":"5","key":"68_CR12","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 (2003) Reachability and distance queries via 2-hop labels. SIAM J Comput 32(5):1338\u20131355","journal-title":"SIAM J Comput"},{"key":"68_CR13","unstructured":"Jin R, Xiang Y, Ruan N, Fuhry D (2009) 3-hop: a high-compression indexing scheme for reachability query, In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of data, ACM, pp. 813\u2013826"},{"issue":"2","key":"68_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce RD, Perry AD (1949) A method of matrix analysis of group structure. Psychometrika 14(2):95\u2013116","journal-title":"Psychometrika"},{"issue":"9","key":"68_CR15","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577","journal-title":"Commun ACM"},{"issue":"1","key":"68_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman SB, Foster BL (1978) A graph-theoretic generalization of the clique concept*. J Math Sociol 6(1):139\u2013154","journal-title":"J Math Sociol"},{"issue":"2","key":"68_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken RJ (1979) Cliques, clubs and clans. Quality & Quantity 13(2):161\u2013173","journal-title":"Quality & Quantity"},{"key":"68_CR18","unstructured":"Abello J, Resende MG, Sudarsky S (2002) Massive quasi-clique detection, In: Latin American Symposium on Theoretical Informatics, Springer, pp. 598\u2013612"},{"key":"68_CR19","unstructured":"Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph, In: International Workshop on Approximation Algorithms for Combinatorial Optimization, Springer, pp. 84\u201395"},{"key":"68_CR20","unstructured":"Lawler EL (2001) Combinatorial optimization: networks and matroids, Courier Corporation"},{"key":"68_CR21","unstructured":"Khuller S, Saha B (2009) On finding dense subgraphs, In: International Colloquium on Automata, Languages, and Programming, Springer, pp. 597\u2013608"},{"key":"68_CR22","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Chu S, \u00d6zsu MT (2011) Efficient core decomposition in massive networks, In: ICDE","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"68_CR23","doi-asserted-by":"crossref","unstructured":"Wen D, Qin L, Zhang Y, Lin X, Yu, JX (2016) I\/o efficient core graph decomposition at web scale, In: ICDE","DOI":"10.1109\/ICDE.2016.7498235"},{"issue":"3","key":"68_CR24","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Soc Netw 5(3):269\u2013287","journal-title":"Soc Netw"},{"key":"68_CR25","unstructured":"Cohen J Trusses: Cohesive subgraphs for social network analysis, Technique report"},{"key":"68_CR26","unstructured":"Batagelj V, Zaversnik M An O(m) algorithm for cores decomposition of networks, CoRR cs.DS\/0310049"},{"issue":"2","key":"68_CR27","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor A, Pellegrini FD, Miorandi D (2013) Distributed k-core decomposition. IEEE Trans Parallel Distrib Syst 24(2):288\u2013300","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"27","key":"68_CR28","doi-asserted-by":"publisher","first-page":"11150","DOI":"10.1073\/pnas.0701175104","volume":"104","author":"S Carmi","year":"2007","unstructured":"Carmi S, Havlin S, Kirkpatrick S, Shavitt Y, Shir E (2007) A model of internet topology using k-shell decomposition. PNAS 104(27):11150\u201311154","journal-title":"PNAS"},{"issue":"10","key":"68_CR29","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"R Li","year":"2014","unstructured":"Li R, Yu JX, Mao R (2014) Efficient core maintenance in large dynamic graphs. IEEE Trans Knowl Data Eng 26(10):2453\u20132465","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"68_CR30","first-page":"85","volume":"6","author":"F Zhao","year":"2012","unstructured":"Zhao F, Tung AKH (2012) Large scale cohesive subgraphs discovery for social network visual analysis. PVLDB 6(2):85\u201396","journal-title":"PVLDB"},{"key":"68_CR31","first-page":"402","volume":"14","author":"R Zhou","year":"2014","unstructured":"Zhou R, Liu C, Yu JX, Liang W, Zhang Y (2014) Efficient truss maintenance in evolving networks. Eprint Arxiv 14:402\u2013407","journal-title":"Eprint Arxiv"},{"key":"68_CR32","unstructured":"Huang X, Lu W, Lakshmanan LV Truss decomposition of probabilistic graphs: Semantics and algorithms"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-018-0068-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-018-0068-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-018-0068-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T00:39:22Z","timestamp":1569199162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-018-0068-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["68"],"URL":"https:\/\/doi.org\/10.1007\/s41019-018-0068-2","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6]]},"assertion":[{"value":"27 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}