{"id":"https://openalex.org/W2579426212","doi":"https://doi.org/10.1090/dimacs/074/10","title":"Parallel shortest path algorithms for solving large-scale instances","display_name":"Parallel shortest path algorithms for solving large-scale instances","publication_year":2009,"publication_date":"2009-07-28","ids":{"openalex":"https://openalex.org/W2579426212","doi":"https://doi.org/10.1090/dimacs/074/10","mag":"2579426212"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/074/10","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074/10","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5057403059","display_name":"Kamesh Madduri","orcid":"https://orcid.org/0000-0003-4344-0957"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kamesh Madduri","raw_affiliation_strings":["#N#\u2021#N#Georgia Institute of Technology#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"#N#\u2021#N#Georgia Institute of Technology#N#","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076610730","display_name":"David A. Bader","orcid":"https://orcid.org/0000-0002-7380-5876"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Bader","raw_affiliation_strings":["#N#\u2021#N#Georgia Institute of Technology#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"#N#\u2021#N#Georgia Institute of Technology#N#","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009558569","display_name":"Jonathan W. Berry","orcid":"https://orcid.org/0000-0002-1768-685X"},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Berry","raw_affiliation_strings":["Sandia National  Laboratories"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sandia National  Laboratories","institution_ids":["https://openalex.org/I4210104735"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041762953","display_name":"Joseph R. Crobak","orcid":null},"institutions":[{"id":"https://openalex.org/I4210096112","display_name":"Rutgers Sexual and Reproductive Health and Rights","ror":"https://ror.org/00rcvgx40","country_code":"NL","type":"other","lineage":["https://openalex.org/I4210096112"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Joseph Crobak","raw_affiliation_strings":["Rutgers University *"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University *","institution_ids":["https://openalex.org/I4210096112"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":14.456,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.99201862,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"249","last_page":"290"},"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.9998999834060669,"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.9998999834060669,"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.9994000196456909,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8254657983779907},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.76723712682724},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7197648286819458},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5510985851287842},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5332502722740173},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5155717730522156},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4452308416366577},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4291975796222687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42858463525772095},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3073883056640625}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8254657983779907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.76723712682724},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7197648286819458},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5510985851287842},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5332502722740173},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5155717730522156},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4452308416366577},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4291975796222687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42858463525772095},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3073883056640625},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1090/dimacs/074/10","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074/10","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.6922","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.6922","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cc.gatech.edu/%7Ebader/papers/ShortestPaths-DIMACS2006.pdf","raw_type":"text"},{"id":"pmh:oai:smartech.gatech.edu:1853/14449","is_oa":false,"landing_page_url":"http://hdl.handle.net/1853/14449","pdf_url":null,"source":{"id":"https://openalex.org/S4377196313","display_name":"SMARTech Repository (Georgia Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130701444","host_organization_name":"Georgia Institute of Technology","host_organization_lineage":["https://openalex.org/I130701444"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W1482680420","https://openalex.org/W1533659219","https://openalex.org/W1537256577","https://openalex.org/W1550136763","https://openalex.org/W1561387203","https://openalex.org/W1567047166","https://openalex.org/W1604585469","https://openalex.org/W1671906456","https://openalex.org/W1971937094","https://openalex.org/W1972595474","https://openalex.org/W1976969221","https://openalex.org/W1999123717","https://openalex.org/W1999545213","https://openalex.org/W2003969379","https://openalex.org/W2008620264","https://openalex.org/W2010039191","https://openalex.org/W2013480322","https://openalex.org/W2014317399","https://openalex.org/W2033740214","https://openalex.org/W2036030013","https://openalex.org/W2039795558","https://openalex.org/W2042068919","https://openalex.org/W2056148792","https://openalex.org/W2056496054","https://openalex.org/W2057112598","https://openalex.org/W2061159212","https://openalex.org/W2061632451","https://openalex.org/W2061635725","https://openalex.org/W2063301486","https://openalex.org/W2083669067","https://openalex.org/W2084224084","https://openalex.org/W2085917651","https://openalex.org/W2097740541","https://openalex.org/W2100586428","https://openalex.org/W2118169763","https://openalex.org/W2124637492","https://openalex.org/W2128616365","https://openalex.org/W2129137345","https://openalex.org/W2130476447","https://openalex.org/W2130790725","https://openalex.org/W2135496605","https://openalex.org/W2148329647","https://openalex.org/W2148606196","https://openalex.org/W2151187166","https://openalex.org/W2164485560","https://openalex.org/W2165301438","https://openalex.org/W2169528473","https://openalex.org/W2171707538","https://openalex.org/W2172262605","https://openalex.org/W2175110005","https://openalex.org/W2404118281","https://openalex.org/W3122602071","https://openalex.org/W3137299218"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W17155033","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W1966837078","https://openalex.org/W2607998022","https://openalex.org/W2059382600","https://openalex.org/W2005006850"],"abstract_inverted_index":{"We":[0,24],"present":[1],"an":[2],"experimental":[3],"study":[4],"of":[5,60,100,116,123,136,148,150],"parallel":[6,41,62,79,138],"algorithms":[7],"for":[8,88],"solving":[9],"the":[10,36,57,65,117,132,146],"single":[11],"source":[12],"shortest":[13],"path":[14],"problem":[15,140],"with":[16,83,119],"non-negative":[17],"edge":[18],"weights":[19],"(NSSP)":[20],"on":[21,35,95,113,141],"large-scale":[22],"graphs.":[23,91],"implement":[25],"Meyer":[26],"and":[27,31,71,104,152],"Sander\u2019s":[28],"\u0394-stepping":[29,94],"algorithm":[30],"report":[32],"performance":[33,134],"results":[34,135],"Cray":[37],"MTA-2,":[38,118],"a":[39,46,84,96,120,137],"multithreaded":[40],"architecture.":[42],"The":[43],"MTA-2":[44],"is":[45],"high-end":[47],"shared":[48],"memory":[49],"system":[50],"offering":[51],"two":[52],"unique":[53],"features":[54],"that":[55],"aid":[56],"efficient":[58],"implementation":[59,76],"irregular":[61],"graph":[63,99,143],"algorithms:":[64],"ability":[66],"to":[67,125],"exploit":[68],"fine-grained":[69],"parallelism,":[70],"low-overhead":[72],"synchronization":[73],"primitives.":[74],"Our":[75],"exhibits":[77],"remarkable":[78],"speedup":[80,122],"when":[81],"compared":[82],"competitive":[85],"sequential":[86],"algorithm,":[87],"low-diameter":[89],"sparse":[90],"For":[92],"instance,":[93],"directed":[97],"scale-free":[98],"100":[101],"million":[102],"vertices":[103,151],"1":[105],"billion":[106],"edges":[107],"takes":[108],"less":[109],"than":[110],"ten":[111],"seconds":[112],"40":[114],"processors":[115],"relative":[121],"close":[124],"30.":[126],"To":[127],"our":[128],"knowledge,":[129],"these":[130],"are":[131],"first":[133],"NSSP":[139],"realistic":[142],"instances":[144],"in":[145],"order":[147],"billions":[149],"edges.":[153],"Contact":[154],"author":[155]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2012,"cited_by_count":11}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}