{"id":"https://openalex.org/W2008169560","doi":"https://doi.org/10.1016/0167-8191(90)90159-7","title":"A sharper analysis of a parallel algorithm for the all pairs shortest path problem","display_name":"A sharper analysis of a parallel algorithm for the all pairs shortest path problem","publication_year":1990,"publication_date":"1990-11-01","ids":{"openalex":"https://openalex.org/W2008169560","doi":"https://doi.org/10.1016/0167-8191(90)90159-7","mag":"2008169560"},"language":"en","primary_location":{"id":"doi:10.1016/0167-8191(90)90159-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-8191(90)90159-7","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel 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/A5113912227","display_name":"Qian Ping Gu","orcid":"https://orcid.org/0009-0008-6605-8615"},"institutions":[{"id":"https://openalex.org/I65143321","display_name":"Hitachi (Japan)","ror":"https://ror.org/02exqgm79","country_code":"JP","type":"company","lineage":["https://openalex.org/I65143321"]},{"id":"https://openalex.org/I6178835","display_name":"Ibaraki University","ror":"https://ror.org/00sjd5653","country_code":"JP","type":"education","lineage":["https://openalex.org/I6178835"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Qian Ping Gu","raw_affiliation_strings":["Department of Computer Science, Ibaraki University, Hitachi, Ibaraki 316, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ibaraki University, Hitachi, Ibaraki 316, Japan","institution_ids":["https://openalex.org/I6178835","https://openalex.org/I65143321"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109861849","display_name":"Tadao Takaoka","orcid":null},"institutions":[{"id":"https://openalex.org/I6178835","display_name":"Ibaraki University","ror":"https://ror.org/00sjd5653","country_code":"JP","type":"education","lineage":["https://openalex.org/I6178835"]},{"id":"https://openalex.org/I65143321","display_name":"Hitachi (Japan)","ror":"https://ror.org/02exqgm79","country_code":"JP","type":"company","lineage":["https://openalex.org/I65143321"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tadao Takaoka","raw_affiliation_strings":["Department of Computer Science, Ibaraki University, Hitachi, Ibaraki 316, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ibaraki University, Hitachi, Ibaraki 316, Japan","institution_ids":["https://openalex.org/I6178835","https://openalex.org/I65143321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113912227"],"corresponding_institution_ids":["https://openalex.org/I6178835","https://openalex.org/I65143321"],"apc_list":{"value":2680,"currency":"USD","value_usd":2680},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.13535245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"1","first_page":"61","last_page":"67"},"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.9995999932289124,"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.9995999932289124,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9983000159263611,"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.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7271207571029663},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6848281025886536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6049799919128418},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5771301984786987},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.541225790977478},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5191797018051147},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.493026465177536},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4792866110801697},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4633541405200958},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.453615665435791},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.43573009967803955},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41397911310195923},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.41192036867141724},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3826378583908081},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2786085605621338}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7271207571029663},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6848281025886536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6049799919128418},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5771301984786987},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.541225790977478},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5191797018051147},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.493026465177536},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4792866110801697},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4633541405200958},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.453615665435791},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.43573009967803955},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41397911310195923},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.41192036867141724},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3826378583908081},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2786085605621338},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0167-8191(90)90159-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-8191(90)90159-7","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1552744309","https://openalex.org/W1655990431","https://openalex.org/W1977119258","https://openalex.org/W2059014957","https://openalex.org/W2482946351"],"related_works":["https://openalex.org/W2002764510","https://openalex.org/W4293054712","https://openalex.org/W2779966368","https://openalex.org/W2100214387","https://openalex.org/W2198982833","https://openalex.org/W2163460271","https://openalex.org/W2183791707","https://openalex.org/W2004635739","https://openalex.org/W2052950624","https://openalex.org/W1994717376"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}