{"id":"https://openalex.org/W2991447257","doi":"https://doi.org/10.1109/hpec.2019.8916434","title":"Fast BFS-Based Triangle Counting on GPUs","display_name":"Fast BFS-Based Triangle Counting on GPUs","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2991447257","doi":"https://doi.org/10.1109/hpec.2019.8916434","mag":"2991447257"},"language":"en","primary_location":{"id":"doi:10.1109/hpec.2019.8916434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2019.8916434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE High Performance Extreme Computing Conference (HPEC)","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/A5070031492","display_name":"Leyuan Wang","orcid":"https://orcid.org/0000-0003-4084-4470"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leyuan Wang","raw_affiliation_strings":["Department of Computer Science, University of California, Davis, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Davis, California","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028662746","display_name":"John D. Owens","orcid":"https://orcid.org/0000-0001-6582-8237"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John D. Owens","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of California, Davis, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of California, Davis, California","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6101,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.73377738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9937999844551086,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8553584218025208},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.785130500793457},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6687302589416504},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6566846966743469},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.579964816570282},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4647355079650879},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.46014153957366943},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.4223896861076355},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33783069252967834}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8553584218025208},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.785130500793457},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6687302589416504},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6566846966743469},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.579964816570282},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4647355079650879},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.46014153957366943},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.4223896861076355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33783069252967834},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec.2019.8916434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2019.8916434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W22572007","https://openalex.org/W78077100","https://openalex.org/W2000041758","https://openalex.org/W2035173902","https://openalex.org/W2041470524","https://openalex.org/W2126359798","https://openalex.org/W2170616854","https://openalex.org/W2403485635","https://openalex.org/W2572767837","https://openalex.org/W2902968852","https://openalex.org/W2951135776","https://openalex.org/W4285719527","https://openalex.org/W6600944653","https://openalex.org/W6603201521"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W1973046741","https://openalex.org/W2983282793","https://openalex.org/W3138386522","https://openalex.org/W2499279132"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,52],"propose":[4],"a":[5,40,68,119],"novel":[6],"method":[7],"to":[8],"compute":[9],"triangle":[10,108],"counting":[11,109],"on":[12,102,106],"GPUs.":[13],"Unlike":[14],"previous":[15,63],"formulations":[16],"of":[17,73,127],"graph":[18,27],"matching,":[19],"our":[20,54,104],"approach":[21],"is":[22,79],"BFS-based":[23],"by":[24],"traversing":[25],"the":[26,47,80,107,112,124],"in":[28,39,56],"an":[29],"all-source-BFS":[30],"manner":[31],"and":[32,51,58,83,90],"thus":[33],"can":[34],"be":[35],"mapped":[36],"onto":[37],"GPUs":[38],"massively":[41],"parallel":[42,84],"fashion.":[43],"Our":[44,77],"implementation":[45,55,105],"uses":[46],"Gunrock":[48],"programming":[49],"model":[50],"evaluate":[53],"runtime":[57],"memory":[59],"consumption":[60],"compared":[61],"with":[62],"state-of-the-art":[64],"work.":[65],"We":[66],"sustain":[67],"peak":[69],"traversed-edgesper-second":[70],"(TEPS)":[71],"rate":[72],"nearly":[74],"10":[75],"GTEPS.":[76],"algorithm":[78],"most":[81],"scalable":[82],"among":[85],"all":[86,93],"existing":[87,94],"GPU":[88],"implementations":[89],"also":[91],"outperforms":[92],"CPU":[95],"distributed":[96],"implementations.":[97],"This":[98],"work":[99],"specifically":[100],"focuses":[101],"leveraging":[103],"problem":[110],"for":[111],"Subgraph":[113],"Isomorphism":[114],"Graph":[115],"Challenge":[116],"2019,":[117],"demonstrating":[118],"geometric":[120],"mean":[121],"speedup":[122],"over":[123],"2018":[125],"champion":[126],"3.84\u00d7.":[128]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}