{"id":"https://openalex.org/W2269957429","doi":"https://doi.org/10.1145/2935764.2935765","title":"Parallel Shortest Paths Using Radius Stepping","display_name":"Parallel Shortest Paths Using Radius Stepping","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2269957429","doi":"https://doi.org/10.1145/2935764.2935765","mag":"2269957429"},"language":"en","primary_location":{"id":"doi:10.1145/2935764.2935765","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935765","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935765&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2935765&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043897310","display_name":"Yan Gu","orcid":"https://orcid.org/0000-0002-8510-3193"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yan Gu","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004374151","display_name":"Yihan Sun","orcid":"https://orcid.org/0000-0002-3212-0934"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yihan Sun","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054849628","display_name":"Kanat Tangwongsan","orcid":"https://orcid.org/0000-0001-9775-8165"},"institutions":[{"id":"https://openalex.org/I25399158","display_name":"Mahidol University","ror":"https://ror.org/01znkr924","country_code":"TH","type":"education","lineage":["https://openalex.org/I25399158"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Kanat Tangwongsan","raw_affiliation_strings":["Mahidol University International College, Nakhonpathom, Thailand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mahidol University International College, Nakhonpathom, Thailand","institution_ids":["https://openalex.org/I25399158"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5033930662"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":3.2345,"has_fulltext":true,"cited_by_count":35,"citation_normalized_percentile":{"value":0.9204962,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"443","last_page":"454"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996399998664856,"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/combinatorics","display_name":"Combinatorics","score":0.7195504903793335},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6170955896377563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6108747720718384},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6032292246818542},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5978869199752808},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5208317041397095},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4997403621673584},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4693411588668823},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4686673879623413},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45283034443855286},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4396117925643921},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4364740252494812},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3436998128890991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28167587518692017}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7195504903793335},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6170955896377563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6108747720718384},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6032292246818542},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5978869199752808},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5208317041397095},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4997403621673584},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4693411588668823},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4686673879623413},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45283034443855286},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4396117925643921},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4364740252494812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3436998128890991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28167587518692017},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2935764.2935765","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935765","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935765&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2935764.2935765","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935765","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935765&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2461472526","display_name":"XPS: FULL: FP: Write-Efficient Parallel Algorithms for Emerging Memory Technologies","funder_award_id":"1533858","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2768444104","display_name":null,"funder_award_id":"CCF-1314590","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3366761448","display_name":null,"funder_award_id":"CCF-1533858","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4247118278","display_name":null,"funder_award_id":"CCF-1314590 and CCF-1533858","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8215190201","display_name":null,"funder_award_id":"1314590","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2269957429.pdf","grobid_xml":"https://content.openalex.org/works/W2269957429.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W140737195","https://openalex.org/W161443406","https://openalex.org/W1584086289","https://openalex.org/W1986816824","https://openalex.org/W1997039683","https://openalex.org/W1998676013","https://openalex.org/W1999545213","https://openalex.org/W2003969379","https://openalex.org/W2008620264","https://openalex.org/W2012329847","https://openalex.org/W2014317399","https://openalex.org/W2015255856","https://openalex.org/W2027428596","https://openalex.org/W2039705515","https://openalex.org/W2044112344","https://openalex.org/W2056148792","https://openalex.org/W2056496054","https://openalex.org/W2057112598","https://openalex.org/W2063301486","https://openalex.org/W2075862701","https://openalex.org/W2084224084","https://openalex.org/W2085630237","https://openalex.org/W2092720654","https://openalex.org/W2120490947","https://openalex.org/W2135674162","https://openalex.org/W2169528473","https://openalex.org/W2755088640","https://openalex.org/W2963973157","https://openalex.org/W3124031623","https://openalex.org/W4231063867"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857","https://openalex.org/W2521054645","https://openalex.org/W2887154986"],"abstract_inverted_index":{"The":[0,56,124,252],"single-source":[1],"shortest":[2],"path":[3],"problem":[4],"(SSSP)":[5],"with":[6,107,120,228],"nonnegative":[7],"edge":[8],"weights":[9],"is":[10,18,126],"notoriously":[11],"difficult":[12],"to":[13,25,143,214,218],"solve":[14],"efficiently":[15,46],"in":[16,32,77,139],"parallel---it":[17],"one":[19,108],"of":[20,37,61,98,109,135,150,190,203],"the":[21,28,34,65,75,96,110,148,188],"graph":[22,183,217,227],"problems":[23],"said":[24],"suffer":[26],"from":[27],"transitive-closure":[29],"bottleneck.":[30],"Yet,":[31],"practice,":[33],"\u0394-stepping":[35],"algorithm":[36,57,106,125,129],"Meyer":[38],"and":[39,91,115,177,231,242,262],"Sanders":[40],"(J.":[41],"Algorithms,":[42],"2003)":[43],"often":[44],"works":[45],"but":[47,80,130],"has":[48,184],"no":[49,267],"known":[50],"theoretical":[51],"bounds":[52,117],"on":[53,95,147],"general":[54],"graphs.":[55],"takes":[58,165,238,255],"a":[59,68,127,132,136,145,160,173,201,216],"sequence":[60],"steps,":[62],"each":[63,85,163,209],"increasing":[64],"radius":[66],"by":[67,154,195],"user-specified":[69],"value":[70],"\u0394.":[71],"Each":[72],"step":[73,164,254],"settles":[74],"vertices":[76,90,230],"its":[78],"annulus":[79],"can":[81,192],"take":[82],"\u0398(n)":[83],"substeps,":[84,208],"requiring":[86],"\u0398(m)":[87],"work":[88,114,241,261],"(n":[89],"m":[92,232],"edges).":[93],"Building":[94],"success":[97],"\u0394-stepping,":[99],"this":[100,185,220],"paper":[101],"describes":[102],"Radius":[103,234],"Stepping,":[104,235],"an":[105,181,224],"best-known":[111],"tradeoffs":[112],"between":[113],"depth":[116,249],"for":[118,200,223],"SSSP":[119],"nearly-linear":[121],"(~O(m))":[122],"work.":[123],"\u0394-stepping-like":[128],"uses":[131],"variable":[133],"instead":[134],"fixed-size":[137],"increase":[138],"radii,":[140],"allowing":[141],"us":[142],"prove":[144],"bound":[146],"number":[149,189],"steps.":[151],"In":[152],"particular,":[153],"using":[155],"what":[156],"we":[157,171],"define":[158,172],"as":[159],"vertex":[161],"k-radius,":[162],"at":[166],"most":[167],"k+2":[168],"substeps.":[169],"Furthermore,":[170],"(k,":[174],"\u03c1)-graph":[175],"property":[176],"show":[178],"that":[179],"if":[180],"undirected":[182],"property,":[186],"then":[187],"steps":[191],"be":[193],"bounded":[194],"O(n/\u03c1":[196],"log":[197,205,244,246,257],"\u03c1":[198,206],"L),":[199],"total":[202],"O(kn/\u03c1":[204],"L)":[207],"parallel.":[210],"We":[211],"describe":[212],"how":[213],"preprocess":[215],"have":[219],"property.":[221],"Altogether,":[222],"arbitrary":[225],"input":[226],"n":[229,245,258],"edges,":[233],"after":[236],"preprocessing,":[237],"O((m+n\u03c1)log":[239],"n)":[240],"$O(n/\u03c1":[243],"(\u03c1":[247],"L))":[248],"per":[250],"source.":[251],"preprocessing":[253],"O(m":[256],"+":[259],"n\u03c12)":[260],"O(\u03c1log":[263],"\u03c1)":[264],"depth,":[265],"adding":[266],"more":[268],"than":[269],"O(n\u03c1)":[270],"edges.":[271]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}