{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:14:21Z","timestamp":1730225661386,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/hpec.2018.8547735","type":"proceedings-article","created":{"date-parts":[[2018,12,8]],"date-time":"2018-12-08T00:50:56Z","timestamp":1544230256000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["Discovering <tex>$k$<\/tex>-Trusses in Large-Scale Networks"],"prefix":"10.1109","author":[{"given":"Alessio","family":"Conte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"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":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091038"},{"key":"ref3","volume":"16","author":"cohen","year":"2008","journal-title":"Trusses Cohesive Subgraphs for Social Network Analysis"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/11427186_54","article-title":"Finding, counting and listing all triangles in large graphs, an experimental study","author":"schank","year":"2005","journal-title":"Experimental and Efficient Algorithms 4th InternationalWorkshop WEA 2005 Santorini Island Greece May 10–13 2005 Proceedings"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091052"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.softx.2017.06.005"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735518"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091049"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091053"},{"journal-title":"Graphchallenge org Raising the bar on graph analytic performance","year":"0","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2577304"},{"journal-title":"Graphchallenge org Raising the bar on graph analytic performance","year":"2018","author":"samsi","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2015.1037030"}],"event":{"name":"2018 IEEE High Performance Extreme Computing Conference (HPEC)","start":{"date-parts":[[2018,9,25]]},"location":"Waltham, MA","end":{"date-parts":[[2018,9,27]]}},"container-title":["2018 IEEE High Performance extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8534508\/8547513\/08547735.pdf?arnumber=8547735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T04:23:57Z","timestamp":1598243037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8547735\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/hpec.2018.8547735","relation":{},"subject":[],"published":{"date-parts":[[2018,9]]}}}