{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,21]],"date-time":"2026-10-21T16:13:00Z","timestamp":1792599180552,"version":"4.5.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,5]]},"abstract":"<jats:p>\n            The\n            <jats:italic>k<\/jats:italic>\n            -truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomial time algorithm for computing\n            <jats:italic>k<\/jats:italic>\n            -truss. Compared with\n            <jats:italic>k<\/jats:italic>\n            -core which is also efficient to compute,\n            <jats:italic>k<\/jats:italic>\n            -truss represents the \"core\" of a\n            <jats:italic>k<\/jats:italic>\n            -core that keeps the key information of, while filtering out less important information from, the\n            <jats:italic>k<\/jats:italic>\n            -core. However, existing algorithms for computing\n            <jats:italic>k<\/jats:italic>\n            -truss are inefficient for handling today's massive networks. We first improve the existing in-memory algorithm for computing\n            <jats:italic>k<\/jats:italic>\n            -truss in networks of moderate size. Then, we propose two I\/O-efficient algorithms to handle massive networks that cannot fit in main memory. Our experiments on real datasets verify the efficiency of our algorithms and the value of\n            <jats:italic>k<\/jats:italic>\n            -truss.\n          <\/jats:p>","DOI":"10.14778\/2311906.2311909","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"812-823","source":"Crossref","is-referenced-by-count":340,"title":["Truss decomposition in massive networks"],"prefix":"10.14778","volume":"5","author":[{"given":"Jia","family":"Wang","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Cheng","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,5]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"598","volume-title":"LATIN","author":"Abello J.","year":"2002"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_2_1_3_1","volume-title":"NIPS","author":"Alvarez-Hamelin J. I.","year":"2005"},{"key":"e_1_2_1_4_1","volume-title":"ISMA Workshop on the Internet Topology","author":"Alvarez-Hamelin J. I.","year":"2006"},{"key":"e_1_2_1_5_1","volume-title":"An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049","author":"Batagelj V.","year":"2003"},{"key":"e_1_2_1_6_1","volume-title":"Short cycle connectivity. Discrete Mathematics, 307(3--5):310--318","author":"Batagelj V.","year":"2007"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0701175104"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807217"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043654"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339724"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382577.2382581"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020513"},{"key":"e_1_2_1_15_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis","author":"Cohen J.","year":"2008"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"e_1_2_1_17_1","first-page":"403","volume-title":"ISAAC (1)","author":"Eppstein D.","year":"2010"},{"key":"e_1_2_1_18_1","volume-title":"Introduction to social network methods","author":"Hanneman R. A.","year":"2005"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(87)90009-8"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289146"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289199"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00091-7"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00139635"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.012582999"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081898"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1978.9989883"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921073"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2311906.2311909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:30:28Z","timestamp":1672223428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2311906.2311909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":32,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["10.14778\/2311906.2311909"],"URL":"https:\/\/doi.org\/10.14778\/2311906.2311909","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}