{"id":"https://openalex.org/W1561387203","doi":"https://doi.org/10.1090/dimacs/030/04","title":"Implementing parallel shortest-paths algorithms","display_name":"Implementing parallel shortest-paths algorithms","publication_year":1997,"publication_date":"1997-02-04","ids":{"openalex":"https://openalex.org/W1561387203","doi":"https://doi.org/10.1090/dimacs/030/04","mag":"1561387203"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/030/04","is_oa":true,"landing_page_url":"https://doi.org/10.1090/dimacs/030/04","pdf_url":"http://www.ams.org/dimacs/030/dimacs030.pdf","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":true,"oa_status":"bronze","oa_url":"http://www.ams.org/dimacs/030/dimacs030.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113772974","display_name":"Marios C. Papaefthymiou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marios Papaefthymiou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5088518115","display_name":"Joseph Rodrigue","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph Rodrigue","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.17661692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"59","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9707000255584717,"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.9707000255584717,"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.9514999985694885,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9187999963760376,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6218795776367188},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.40539196133613586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3893066346645355}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6218795776367188},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40539196133613586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3893066346645355}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1090/dimacs/030/04","is_oa":true,"landing_page_url":"https://doi.org/10.1090/dimacs/030/04","pdf_url":"http://www.ams.org/dimacs/030/dimacs030.pdf","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.48.9811","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.9811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.yale.edu/WWW/pub/marios/para-shortest-paths.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.6379","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.6379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.yale.edu/pub/rodrigue/final-report.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1090/dimacs/030/04","is_oa":true,"landing_page_url":"https://doi.org/10.1090/dimacs/030/04","pdf_url":"http://www.ams.org/dimacs/030/dimacs030.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2317200988","https://openalex.org/W2376932109","https://openalex.org/W2382290278","https://openalex.org/W2350741829"],"abstract_inverted_index":{".":[0],"We":[1,33],"have":[2,34],"implemented":[3],"two":[4],"parallel":[5,27,40,77],"versions":[6],"of":[7,38,46,89,115,142],"the":[8,12,25,36,47,86,90,96,102],"Bellman-FordMoore":[9],"algorithm":[10,49],"for":[11,95,101],"single-source":[13],"shortest-paths":[14,128],"problem.":[15],"Our":[16,75],"software":[17],"is":[18,130],"written":[19],"in":[20,105,138],"C":[21],"and":[22,54,71,98,149,154],"runs":[23],"on":[24,119],"CM-5":[26,121],"supercomputer":[28],"using":[29],"CMMD":[30],"communication":[31],"primitives.":[32],"compared":[35],"performance":[37],"our":[39,57,106],"programs":[41],"with":[42,65,122],"a":[43,120,131,139],"serial":[44,153],"implementation":[45],"Bellman-Ford-Moore":[48],"developed":[50],"by":[51],"Cherkassky,":[52],"Goldberg":[53],"Radzik.":[55],"In":[56],"experiments":[58],"we":[59,112],"used":[60],"50":[61],"randomly":[62],"generated":[63],"graphs":[64,91],"up":[66,116],"to":[67,117],"2":[68,72,93,99],"15":[69],"vertices":[70],"21":[73],"edges.":[74],"fastest":[76],"program":[78],"always":[79],"achieved":[80,113],"speedups":[81,114],"greater":[82],"than":[83],"1":[84],"when":[85],"average":[87],"degree":[88],"exceeded":[92],"5":[94],"smaller":[97],"3":[100],"larger":[103],"inputs":[104],"test":[107],"suite.":[108],"On":[109],"dense":[110],"graphs,":[111],"7.8":[118],"32":[123],"processors.":[124],"1.":[125],"Introduction":[126],"The":[127],"problem":[129,135],"classic":[132],"combinatorial":[133],"optimization":[134],"that":[136],"arises":[137],"wide":[140],"spectrum":[141],"applications":[143],"including":[144],"VLSI":[145],"design,":[146],"network":[147],"routing,":[148],"commodity":[150],"flow.":[151],"Several":[152],"paralle...":[155]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}