{"id":"https://openalex.org/W2793079","doi":"https://doi.org/10.1007/bf02254849","title":"Parallel algorithms for the single source shortest path problem","display_name":"Parallel algorithms for the single source shortest path problem","publication_year":1982,"publication_date":"1982-03-01","ids":{"openalex":"https://openalex.org/W2793079","doi":"https://doi.org/10.1007/bf02254849","mag":"2793079"},"language":"en","primary_location":{"id":"doi:10.1007/bf02254849","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02254849","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing","raw_type":"journal-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/A5032454549","display_name":"Prabhaker Mateti","orcid":null},"institutions":[{"id":"https://openalex.org/I58956616","display_name":"Case Western Reserve University","ror":"https://ror.org/051fd9666","country_code":"US","type":"education","lineage":["https://openalex.org/I58956616"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"P. Mateti","raw_affiliation_strings":["Department of Computer Engineering and Science, Case Western Reserve University, 44106, Cleveland, OH, U.S.A","Case Western Reserve University, Cleveland,OH"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Science, Case Western Reserve University, 44106, Cleveland, OH, U.S.A","institution_ids":[]},{"raw_affiliation_string":"Case Western Reserve University, Cleveland,OH","institution_ids":["https://openalex.org/I58956616"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108559244","display_name":"Narsingh Deo","orcid":null},"institutions":[{"id":"https://openalex.org/I72951846","display_name":"Washington State University","ror":"https://ror.org/05dk0ce17","country_code":"US","type":"education","lineage":["https://openalex.org/I72951846"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Deo","raw_affiliation_strings":["Computer Science Department, Washington State University, 99164, Pullman, WA, U.S.A","Washington State University\u2014Pullman"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Washington State University, 99164, Pullman, WA, U.S.A","institution_ids":[]},{"raw_affiliation_string":"Washington State University\u2014Pullman","institution_ids":["https://openalex.org/I72951846"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032454549"],"corresponding_institution_ids":["https://openalex.org/I58956616"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.6092,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.69503692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"1","first_page":"31","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9990000128746033,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9952999949455261,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8127236366271973},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7781714200973511},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6959383487701416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6653833389282227},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6140098571777344},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5190006494522095},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.47487446665763855},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45180052518844604},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4208362102508545},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4198110103607178},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3474906086921692},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18399077653884888},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08255916833877563}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8127236366271973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7781714200973511},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6959383487701416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6653833389282227},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6140098571777344},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5190006494522095},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.47487446665763855},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45180052518844604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4208362102508545},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4198110103607178},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3474906086921692},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18399077653884888},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08255916833877563},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02254849","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02254849","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1490289901","https://openalex.org/W1519532587","https://openalex.org/W1554451661","https://openalex.org/W1584774780","https://openalex.org/W1586380695","https://openalex.org/W1660812717","https://openalex.org/W1965662337","https://openalex.org/W1970603830","https://openalex.org/W1994350081","https://openalex.org/W2012383375","https://openalex.org/W2012667106","https://openalex.org/W2024760761","https://openalex.org/W2034672230","https://openalex.org/W2053723217","https://openalex.org/W2057084070","https://openalex.org/W2063317962","https://openalex.org/W2086825382","https://openalex.org/W2092330486","https://openalex.org/W2125690626","https://openalex.org/W2132334337","https://openalex.org/W2169528473","https://openalex.org/W6606043608"],"related_works":["https://openalex.org/W55831818","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}