{"id":"https://openalex.org/W4285009392","doi":"https://doi.org/10.1145/3490148.3538583","title":"Parallel Shortest Paths with Negative Edge Weights","display_name":"Parallel Shortest Paths with Negative Edge Weights","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285009392","doi":"https://doi.org/10.1145/3490148.3538583"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538583","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","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/A5030710270","display_name":"Nairen Cao","orcid":"https://orcid.org/0000-0002-4961-763X"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nairen Cao","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022670058","display_name":"Katina Russell","orcid":"https://orcid.org/0009-0005-6230-8427"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Katina Russell","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030710270"],"corresponding_institution_ids":["https://openalex.org/I184565670"],"apc_list":null,"apc_paid":null,"fwci":0.2922,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57390779,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"177","last_page":"190"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7645118832588196},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6616882681846619},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5642626285552979},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5608314871788025},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5380382537841797},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5056896209716797},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4885202646255493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4616929292678833},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44807201623916626},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.44334715604782104},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4317278563976288},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.42612963914871216},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.4186103343963623},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.410763680934906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3980846703052521},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3856697082519531},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2762066125869751},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.13746672868728638}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7645118832588196},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6616882681846619},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5642626285552979},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5608314871788025},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5380382537841797},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5056896209716797},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4885202646255493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4616929292678833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44807201623916626},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.44334715604782104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4317278563976288},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.42612963914871216},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.4186103343963623},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.410763680934906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3980846703052521},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3856697082519531},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2762066125869751},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.13746672868728638},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3490148.3538583","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W2003969379","https://openalex.org/W2044112344","https://openalex.org/W2056496054","https://openalex.org/W2063301486","https://openalex.org/W2085630237","https://openalex.org/W2120490947","https://openalex.org/W2139559590","https://openalex.org/W2164141517","https://openalex.org/W2469481711","https://openalex.org/W2568484534","https://openalex.org/W2945481216","https://openalex.org/W2951926403","https://openalex.org/W2963618817","https://openalex.org/W3034281291","https://openalex.org/W3034415339","https://openalex.org/W3034903651","https://openalex.org/W3037464308","https://openalex.org/W3041171185","https://openalex.org/W3124031623","https://openalex.org/W3126680358","https://openalex.org/W3129191225","https://openalex.org/W4221155786","https://openalex.org/W4372046852"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W3183360588","https://openalex.org/W2237480599","https://openalex.org/W4293054712","https://openalex.org/W3205592527","https://openalex.org/W2612665926","https://openalex.org/W4294360851","https://openalex.org/W2100214387","https://openalex.org/W2348504720"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3],"parallel":[4,74],"version":[5,75],"of":[6,12,76],"Goldberg's":[7,62,77],"algorithm":[8,56,63],"for":[9],"the":[10,38,98],"problem":[11,39],"single-source":[13],"shortest":[14],"paths":[15],"with":[16,26,40,52,87],"integer":[17,32],"(including":[18],"negatives)":[19],"edge":[20],"weights.":[21],"Given":[22],"an":[23],"input":[24],"graph":[25],"n":[27],"vertices,":[28],"m":[29],"edges,":[30],"and":[31,46,90],"weights":[33],"\u2265-N,":[34],"our":[35,73],"algorithms":[36],"solves":[37],"\u00d5(m":[41],"\u221an":[42],"log":[43,48],"N)":[44],"work":[45,59,88],"n5/4+o(1)":[47],"N":[49],"span,":[50],"both":[51,86],"high":[53],"probability.":[54],"Our":[55],"thus":[57],"has":[58],"similar":[60],"to":[61],"while":[64],"also":[65],"achieving":[66],"at":[67],"least":[68],"m1/4-o(1)":[69],"parallelism.":[70],"To":[71],"generate":[72],"algorithm,":[78],"we":[79],"solve":[80],"two":[81],"specific":[82],"distance-limited":[83],"shortest-path":[84],"problems,":[85],"\u00d5(m)":[89],"span":[91],"\u221aL":[92],"\u00b7":[93],"n1/2+o(1),":[94],"where":[95],"L":[96],"is":[97],"distance":[99],"limit.":[100]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}