{"id":"https://openalex.org/W4410037283","doi":"https://doi.org/10.1145/3711708.3723448","title":"Techniques for Practical Parallel BFS and SSSP","display_name":"Techniques for Practical Parallel BFS and SSSP","publication_year":2025,"publication_date":"2025-03-01","ids":{"openalex":"https://openalex.org/W4410037283","doi":"https://doi.org/10.1145/3711708.3723448"},"language":"en","primary_location":{"id":"doi:10.1145/3711708.3723448","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3711708.3723448","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723448","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.3723448","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114730512","display_name":"Quinten De Man","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Quinten De Man","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0009-0009-1321-9590","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5098684196","display_name":"Richard Wen","orcid":"https://orcid.org/0009-0004-1770-4829"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Wen","raw_affiliation_strings":["University of Maryland, College Park, NJ, USA"],"raw_orcid":"https://orcid.org/0009-0004-1770-4829","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, NJ, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065818820","display_name":"Laxman Dhulipala","orcid":"https://orcid.org/0000-0003-0685-064X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laxman Dhulipala","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0000-0003-0685-064X","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"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.06473556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"38","last_page":"42"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6616001129150391},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5127307176589966}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6616001129150391},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5127307176589966}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3711708.3723448","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3711708.3723448","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723448","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.3723448","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3711708.3723448","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3711708.3723448","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4410037283.pdf","grobid_xml":"https://content.openalex.org/works/W4410037283.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W2029852131","https://openalex.org/W2057112598","https://openalex.org/W2082773934","https://openalex.org/W2095677000","https://openalex.org/W2100061495","https://openalex.org/W2269957429","https://openalex.org/W3034302216","https://openalex.org/W3173178143","https://openalex.org/W4253426709"],"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],"and":[3,28,47,107],"single":[4],"source":[5],"shortest":[6],"paths":[7],"(SSSP)":[8],"are":[9,44],"two":[10],"fundamental":[11],"graph":[12],"problems":[13,33],"with":[14,111],"countless":[15],"real-world":[16,79],"applications.":[17],"It":[18],"is":[19,40,49,105],"of":[20,78],"major":[21],"interest":[22],"to":[23,30,69],"develop":[24,70],"efficient":[25],"parallel":[26,73],"algorithms":[27],"implementations":[29],"solve":[31],"these":[32,42],"on":[34,96],"modern":[35],"multicore":[36],"architectures.":[37],"The":[38],"challenge":[39],"that":[41,53],"computations":[43],"often":[45],"irregular,":[46],"there":[48],"no":[50],"known":[51],"algorithm":[52,113],"guarantees":[54],"polylogarithmic":[55],"depth":[56],"for":[57,75,114],"all":[58,76],"graphs.":[59,80],"For":[60,81],"BFS,":[61],"this":[62],"paper":[63],"describe":[64],"several":[65],"performance":[66],"engineering":[67],"methods":[68],"a":[71,85],"practical":[72],"implementation":[74],"classes":[77],"SSSP,":[82],"we":[83],"introduce":[84],"unique":[86],"contraction":[87],"based":[88],"preprocessing":[89],"method":[90,104],"which":[91],"significantly":[92],"speeds":[93],"up":[94],"queries":[95],"high":[97],"diameter":[98],"graphs,":[99],"like":[100],"road":[101],"networks.":[102],"Our":[103],"generic":[106],"can":[108],"be":[109],"used":[110],"any":[112],"SSSP":[115],"queries.":[116]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}