{"id":"https://openalex.org/W2295060779","doi":"https://doi.org/10.1109/bigcomp.2016.7425819","title":"Exploiting CPU parallelism for triangle listing using hybrid summarized bit batch vector","display_name":"Exploiting CPU parallelism for triangle listing using hybrid summarized bit batch vector","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2295060779","doi":"https://doi.org/10.1109/bigcomp.2016.7425819","mag":"2295060779"},"language":"en","primary_location":{"id":"doi:10.1109/bigcomp.2016.7425819","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigcomp.2016.7425819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Big Data and Smart Computing (BigComp)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001711861","display_name":"Mostofa Kamal Rasel","orcid":"https://orcid.org/0000-0003-3051-3838"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Mostofa Kamal Rasel","raw_affiliation_strings":["Department of Computer Engineering, Kyung Hee University Korea, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kyung Hee University Korea, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039165136","display_name":"Young-Koo Lee","orcid":"https://orcid.org/0000-0003-2314-5395"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Young-Koo Lee","raw_affiliation_strings":["Department of Computer Engineering, Kyung Hee University Korea, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kyung Hee University Korea, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001711861"],"corresponding_institution_ids":["https://openalex.org/I35928602"],"apc_list":null,"apc_paid":null,"fwci":0.334,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63829359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8216032385826111},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.8149165511131287},{"id":"https://openalex.org/keywords/listing","display_name":"Listing (finance)","score":0.6908483505249023},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5930162668228149},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4991731643676758},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43198734521865845},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42382875084877014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3075793981552124}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8216032385826111},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.8149165511131287},{"id":"https://openalex.org/C2779820595","wikidata":"https://www.wikidata.org/wiki/Q798505","display_name":"Listing (finance)","level":2,"score":0.6908483505249023},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5930162668228149},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4991731643676758},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43198734521865845},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42382875084877014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3075793981552124},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigcomp.2016.7425819","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigcomp.2016.7425819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Big Data and Smart Computing (BigComp)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322214","display_name":"Industrial Technology Research Institute","ror":"https://ror.org/05szzwt63"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W950821216","https://openalex.org/W1489509891","https://openalex.org/W1582397847","https://openalex.org/W1968041356","https://openalex.org/W1974121232","https://openalex.org/W1982311747","https://openalex.org/W1982945449","https://openalex.org/W2001125165","https://openalex.org/W2010347674","https://openalex.org/W2011267080","https://openalex.org/W2013414394","https://openalex.org/W2016311778","https://openalex.org/W2030088585","https://openalex.org/W2037774459","https://openalex.org/W2055245094","https://openalex.org/W2061901927","https://openalex.org/W2071774356","https://openalex.org/W2080312846","https://openalex.org/W2090885171","https://openalex.org/W2093063455","https://openalex.org/W2101267973","https://openalex.org/W2102322109","https://openalex.org/W2111787123","https://openalex.org/W2112090702","https://openalex.org/W2121806125","https://openalex.org/W2127083693","https://openalex.org/W2137572956","https://openalex.org/W2138662031","https://openalex.org/W2154191591","https://openalex.org/W2214683327","https://openalex.org/W3098475836","https://openalex.org/W4214508572","https://openalex.org/W6668517214","https://openalex.org/W6688161286"],"related_works":["https://openalex.org/W293204540","https://openalex.org/W4360847453","https://openalex.org/W2611163850","https://openalex.org/W2795534283","https://openalex.org/W1554695299","https://openalex.org/W2045183646","https://openalex.org/W4210513147","https://openalex.org/W1595672120","https://openalex.org/W4230999561","https://openalex.org/W2900798793"],"abstract_inverted_index":{"Presence":[0],"of":[1,49,65,98,108],"triangles":[2,86],"in":[3,129],"massive":[4,19,109],"graphs":[5,20,23],"provides":[6],"many":[7],"important":[8],"indications":[9],"to":[10,45,84,103],"different":[11],"graph":[12],"algorithms.":[13],"In-memory":[14],"algorithms":[15,32],"don't":[16],"work":[17],"for":[18,36,80],"since":[21],"these":[22],"cannot":[24],"fit":[25],"into":[26],"the":[27,47,53,77,89,95,105,122,139],"memory.":[28],"Recently,":[29],"external":[30],"memory-based":[31],"have":[33],"been":[34],"proposed":[35,136],"efficient":[37,78],"triangle":[38,50,116],"listing":[39,117],"which":[40],"focused":[41],"on":[42,76],"I/O":[43],"efficiency":[44],"improve":[46],"performance":[48],"listing.":[51],"However,":[52],"existing":[54,140],"studies":[55],"still":[56],"suffer":[57],"from":[58,62],"tremendous":[59],"calculations":[60],"result":[61],"involving":[63],"lot":[64],"I/Os":[66],"and":[67,126],"joining":[68,81],"operations":[69],"between":[70],"adjacency":[71,82,106],"lists.":[72],"This":[73],"paper":[74],"focuses":[75],"technique":[79,137],"lists":[83,107],"output":[85],"by":[87],"exploiting":[88],"CPU":[90],"parallelism.":[91],"We":[92,111,131],"first":[93],"present":[94],"new":[96],"notions":[97],"summarized":[99,124],"bit":[100],"batch":[101],"vector":[102],"represent":[104],"graphs.":[110],"then":[112],"propose":[113],"a":[114],"parallel":[115],"algorithm":[118],"that":[119,134],"asynchronously":[120],"access":[121],"indexed":[123],"data":[125],"join":[127],"them":[128],"groups.":[130],"experimentally":[132],"show":[133],"our":[135],"outperforms":[138],"solutions":[141],"significantly.":[142]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}