{"id":"https://openalex.org/W2024960454","doi":"https://doi.org/10.1016/0743-7315(91)90083-l","title":"Scalability of parallel algorithms for the all-pairs shortest-path problem","display_name":"Scalability of parallel algorithms for the all-pairs shortest-path problem","alternate_titles":[],"publication_year":1991,"publication_date":"1991-10-01","ids":{"openalex":"https://openalex.org/W2024960454","doi":"https://doi.org/10.1016/0743-7315(91)90083-l","mag":"2024960454"},"language":"en","primary_location":{"id":"doi:10.1016/0743-7315(91)90083-l","doi":"https://doi.org/10.1016/0743-7315(91)90083-l","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0743-7315(91)90083-l","pdf_url":null,"source":{"id":"https://openalex.org/S157146593","display_name":"Journal of Parallel and Distributed Computing","issn_l":"0743-7315","issn":["0743-7315","1096-0848"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-100","russia-white-list-1"],"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":"Journal of Parallel and Distributed Computing","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2024960454"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5040319974","display_name":"Vipin Kumar","orcid":"https://orcid.org/0000-0003-4736-7582","observed_orcids":["https://orcid.org/0000-0003-4736-7582"]},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vipin Kumar","raw_affiliation_strings":["Computer Science Department, University of Minnesota, Minneapolis, Minnesota 55455, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Minnesota, Minneapolis, Minnesota 55455, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030983403","display_name":"Vineet Singh","orcid":"https://orcid.org/0000-0002-1975-1678","observed_orcids":["https://orcid.org/0000-0002-1975-1678"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vineet Singh","raw_affiliation_strings":["MCC, 3500 West Balcones Center Drive, Austin, Texas 78759, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MCC, 3500 West Balcones Center Drive, Austin, Texas 78759, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3250,"currency":"USD","value_usd":3250},"apc_paid":null,"fwci":5.4737,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.95485417,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":"13","issue":"2","first_page":"124","last_page":"138"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.7797999978065491,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.7797999978065491,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.13600000739097595,"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.07050000131130219,"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/all-pairs-shortest-paths","display_name":"all-pairs shortest paths","score":0.9319999814033508},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9670000076293945},{"id":"https://openalex.org/keywords/scalability","display_name":"scalability","score":0.6700000166893005},{"id":"https://openalex.org/keywords/dense-graphs","display_name":"dense graphs","score":0.8980000019073486},{"id":"https://openalex.org/keywords/mesh-architecture","display_name":"mesh architecture","score":0.8180000185966492},{"id":"https://openalex.org/keywords/hypercube-architecture","display_name":"hypercube architecture","score":0.9570000171661377},{"id":"https://openalex.org/keywords/shared-memory-architecture","display_name":"shared memory architecture","score":0.9570000171661377}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8783780336380005},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.871910572052002},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.7108239531517029},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6257997155189514},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6223694682121277},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5556452870368958},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5485979318618774},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4571492671966553},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.45641782879829407},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43712109327316284},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.41886845231056213},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.32811450958251953},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2775316834449768},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/0743-7315(91)90083-l","doi":"https://doi.org/10.1016/0743-7315(91)90083-l","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0743-7315(91)90083-l","pdf_url":null,"source":{"id":"https://openalex.org/S157146593","display_name":"Journal of Parallel and Distributed Computing","issn_l":"0743-7315","issn":["0743-7315","1096-0848"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-100","russia-white-list-1"],"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":"Journal of Parallel and Distributed Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.135.2917","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.2917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umn.edu/~kumar/papers/shortest-path.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.46.172","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.umn.edu/dept/users/kumar/shortest-path.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W15193785","https://openalex.org/W127166643","https://openalex.org/W140737195","https://openalex.org/W1521982276","https://openalex.org/W1546468069","https://openalex.org/W1561673278","https://openalex.org/W1586982749","https://openalex.org/W1603765807","https://openalex.org/W1689272351","https://openalex.org/W1725423100","https://openalex.org/W1977041160","https://openalex.org/W1979566015","https://openalex.org/W1988185570","https://openalex.org/W2063317962","https://openalex.org/W2074176412","https://openalex.org/W2095624907","https://openalex.org/W2109560070","https://openalex.org/W2157653704","https://openalex.org/W2159008239","https://openalex.org/W2186799393","https://openalex.org/W4249486448","https://openalex.org/W4300769941","https://openalex.org/W6637560908","https://openalex.org/W6683516756","https://openalex.org/W7048087161"],"related_works":["https://openalex.org/W7100685535","https://openalex.org/W3146328272","https://openalex.org/W2347834984","https://openalex.org/W2083838623","https://openalex.org/W15193785","https://openalex.org/W2093171965","https://openalex.org/W1515810787","https://openalex.org/W2263606085","https://openalex.org/W2047789338","https://openalex.org/W2045580243"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2024960454","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
