{"id":"https://openalex.org/W4410037166","doi":"https://doi.org/10.1145/3711708.3723444","title":"BFSBlitz: A Highly Parallel Graph System for Breadth-First Search","display_name":"BFSBlitz: A Highly Parallel Graph System for Breadth-First Search","publication_year":2025,"publication_date":"2025-03-01","ids":{"openalex":"https://openalex.org/W4410037166","doi":"https://doi.org/10.1145/3711708.3723444"},"language":"en","primary_location":{"id":"doi:10.1145/3711708.3723444","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3711708.3723444","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723444","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st FastCode Programming Challenge","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723444","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093240782","display_name":"Sakib Fuad","orcid":"https://orcid.org/0009-0006-7586-4753"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sakib Fuad","raw_affiliation_strings":["University of California, Riverside, Riverside, CA, USA"],"raw_orcid":"https://orcid.org/0009-0006-7586-4753","affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5117414822","display_name":"Ashkan Vedadi Gargary","orcid":"https://orcid.org/0009-0004-2128-5735"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ashkan Vedadi Gargary","raw_affiliation_strings":["University of California, Riverside, Riverside, CA, USA"],"raw_orcid":"https://orcid.org/0009-0004-2128-5735","affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06470594,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"33","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11106","display_name":"Data Management and Algorithms","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.750613808631897},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47555941343307495},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.46498391032218933},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3750099539756775},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17261719703674316}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.750613808631897},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47555941343307495},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.46498391032218933},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3750099539756775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17261719703674316}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3711708.3723444","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3711708.3723444","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723444","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st FastCode Programming Challenge","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3711708.3723444","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3711708.3723444","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723444","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st FastCode Programming Challenge","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4410037166.pdf","grobid_xml":"https://content.openalex.org/works/W4410037166.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W2143286114","https://openalex.org/W2144085134","https://openalex.org/W2564407003","https://openalex.org/W2803753832","https://openalex.org/W3041215255","https://openalex.org/W3103193719","https://openalex.org/W4376652697","https://openalex.org/W4401019484"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Breadth-First":[0],"Search":[1],"(BFS)":[2],"is":[3],"a":[4,35],"fundamental":[5],"graph":[6,32],"traversal":[7],"algorithm":[8],"widely":[9],"used":[10],"in":[11],"applications":[12],"such":[13],"as":[14],"social":[15],"network":[16],"analysis,":[17],"web":[18],"crawling,":[19],"and":[20,30,46],"shortest":[21],"path":[22],"computations.":[23],"However,":[24],"efficiently":[25],"parallelizing":[26],"BFS":[27],"for":[28],"large-scale":[29],"irregular":[31],"structures":[33],"remains":[34],"significant":[36],"challenge":[37],"due":[38],"to":[39],"issues":[40],"like":[41],"workload":[42],"imbalance,":[43],"excessive":[44],"synchronization,":[45],"data":[47],"locality":[48],"constraints.":[49]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}