{"id":"https://openalex.org/W2033740214","doi":"https://doi.org/10.1007/bf02523680","title":"Efficient parallel algorithms for computing all pair shortest paths in directed graphs","display_name":"Efficient parallel algorithms for computing all pair shortest paths in directed graphs","publication_year":1997,"publication_date":"1997-04-01","ids":{"openalex":"https://openalex.org/W2033740214","doi":"https://doi.org/10.1007/bf02523680","mag":"2033740214"},"language":"en","primary_location":{"id":"doi:10.1007/bf02523680","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02523680","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5091329448","display_name":"Yijie Han","orcid":"https://orcid.org/0000-0003-1305-6815"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yijie Han","raw_affiliation_strings":["Department of Computer Science, University of Kentucky, 40506, Lexington, KY, USA","Department of Computer Science, University of Kentucky Lexington, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kentucky, 40506, Lexington, KY, USA","institution_ids":["https://openalex.org/I143302722"]},{"raw_affiliation_string":"Department of Computer Science, University of Kentucky Lexington, USA","institution_ids":["https://openalex.org/I143302722"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056866601","display_name":"Victor Y. Pan","orcid":"https://orcid.org/0000-0002-9819-9358"},"institutions":[{"id":"https://openalex.org/I161301626","display_name":"Lehman College","ror":"https://ror.org/03m908832","country_code":"US","type":"education","lineage":["https://openalex.org/I161301626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V. Y. Pan","raw_affiliation_strings":["Department of Mathematics and Computer Science, Lehman College, CUNY, 10468, Bronx, NY, USA","Department of Mathematics and Computer Science, Lehman College \u2013 CUNY, Bronx, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Lehman College, CUNY, 10468, Bronx, NY, USA","institution_ids":["https://openalex.org/I161301626"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Lehman College \u2013 CUNY, Bronx, USA","institution_ids":["https://openalex.org/I161301626"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007364145","display_name":"John H. Reif","orcid":"https://orcid.org/0000-0002-9096-2056"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. H. Reif","raw_affiliation_strings":["Department of Computer Science, Duke University, 27706, Durham, NC, USA","Department of Computer Science Duke University, Durham, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, 27706, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Department of Computer Science Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.0731,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.86536019,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"17","issue":"4","first_page":"399","last_page":"415"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.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/T10829","display_name":"Interconnection Networks and Systems","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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6980191469192505},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6455593109130859},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5720495581626892},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5698121786117554},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5081629753112793},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.44655412435531616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4413221478462219},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36595994234085083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35935911536216736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3393881022930145}],"concepts":[{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6980191469192505},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6455593109130859},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5720495581626892},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5698121786117554},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5081629753112793},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.44655412435531616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4413221478462219},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36595994234085083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35935911536216736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3393881022930145}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02523680","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02523680","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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":20,"referenced_works":["https://openalex.org/W140737195","https://openalex.org/W1512709563","https://openalex.org/W1594925095","https://openalex.org/W2007572995","https://openalex.org/W2007633368","https://openalex.org/W2022980325","https://openalex.org/W2028341270","https://openalex.org/W2029342163","https://openalex.org/W2033191517","https://openalex.org/W2060919812","https://openalex.org/W2061420453","https://openalex.org/W2063204215","https://openalex.org/W2066582699","https://openalex.org/W2079697168","https://openalex.org/W2083322535","https://openalex.org/W2088570605","https://openalex.org/W2089062581","https://openalex.org/W2132750992","https://openalex.org/W2169528473","https://openalex.org/W2618199688"],"related_works":["https://openalex.org/W2070865675","https://openalex.org/W2003502867","https://openalex.org/W2136838521","https://openalex.org/W2142561263","https://openalex.org/W1970073092","https://openalex.org/W3046990805","https://openalex.org/W1994184712","https://openalex.org/W4287691960","https://openalex.org/W2036758175","https://openalex.org/W1972433940"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}