{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T01:49:42Z","timestamp":1768787382486,"version":"3.49.0"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Italian Ministry of University and Research (MIUR) through the PRIN Project AHeAD","award":["20174LF3T8"],"award-info":[{"award-number":["20174LF3T8"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3011667","type":"journal-article","created":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T20:27:57Z","timestamp":1595622477000},"page":"139096-139109","source":"Crossref","is-referenced-by-count":10,"title":["Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0770-2235","authenticated-orcid":false,"given":"Alessio","family":"Conte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7244-639X","authenticated-orcid":false,"given":"Daniele","family":"De Sensi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Versari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","article-title":"Enumerating k-vertex connected components in large graphs","author":"wen","year":"2017","journal-title":"arXiv 1703 08668"},{"key":"ref32","first-page":"805","article-title":"Two efficient local search algorithms for maximum weight clique problem","author":"wang","year":"2016","journal-title":"Proc AAAI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091037"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2018.8508642"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091043"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.67"},{"key":"ref10","first-page":"3","article-title":"Trusses: Cohesive subgraphs for social network analysis","volume":"16","author":"cohen","year":"2008","journal-title":"Technical Report of National Security Agency"},{"key":"ref11","first-page":"1","article-title":"Discovering k-trusses in large-scale networks","author":"conte","year":"2018","journal-title":"Proc IEEE High Perform Extreme Comput Conf (HPEC)"},{"key":"ref12","first-page":"173","article-title":"Finding all maximal cliques in very large social networks","author":"conte","year":"2016","journal-title":"Proc Int Conf on Extending Database Technology (EDBT)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547538"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54423-1_22"},{"key":"ref16","first-page":"44","article-title":"Corecluster: A degeneracy based graph clustering framework","volume":"14","author":"giatsidis","year":"2014","journal-title":"Proc AAAI"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091038"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091052"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091049"},{"key":"ref4","first-page":"41","article-title":"Large scale networks fingerprinting and visualization using the k-core decomposition","author":"alvarez-hamelin","year":"2006","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547527"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3160017"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-006-9039-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091034"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2014.7004264"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916285"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735484"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547517"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547718"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091051"},{"key":"ref23","year":"2017","journal-title":"Graphchallenge org Raising the bar on graph analytic performance"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742736"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547572"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09146824.pdf?arnumber=9146824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:32Z","timestamp":1642003052000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9146824\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3011667","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}