{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T00:37:21Z","timestamp":1746319041120,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/hpec.2018.8547718","type":"proceedings-article","created":{"date-parts":[[2018,12,8]],"date-time":"2018-12-08T00:50:56Z","timestamp":1544230256000},"page":"1-7","source":"Crossref","is-referenced-by-count":14,"title":["Linear Algebraic Formulation of Edge-centric K-truss Algorithms with Adjacency Matrices"],"prefix":"10.1109","author":[{"given":"Tze Meng","family":"Low","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele G.","family":"Spampinato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anurag","family":"Kutuluru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Upasana","family":"Sridhar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doru Thom","family":"Popovici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Franchetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"McMillan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Galois C++ library for multi-core and multi-node parallelization","year":"2018","key":"ref10"},{"journal-title":"SNAP Datasets Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref11"},{"journal-title":"Measurement and Analysis on the WIDE Internet","year":"2014","author":"group","key":"ref12"},{"key":"ref13","volume":"abs 1707 2000","author":"kabir","year":"2017","journal-title":"Shared-memory graph truss decomposition"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091037"},{"journal-title":"Trusses Cohesive Subgraphs for Social Network Analysis","year":"2008","author":"cohen","key":"ref3"},{"journal-title":"OpenMP Application Program Interface","year":"2015","key":"ref6"},{"key":"ref5","volume":"abs 1708 6866","author":"samsi","year":"2017","journal-title":"Static graph challenge Subgraph isomorphism"},{"journal-title":"The Julia programming language","year":"2018","key":"ref8"},{"journal-title":"Graph challenge","year":"2017","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"}],"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\/08547718.pdf?arnumber=8547718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:24:10Z","timestamp":1598221450000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8547718\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/hpec.2018.8547718","relation":{},"subject":[],"published":{"date-parts":[[2018,9]]}}}