{"id":"https://openalex.org/W2121915725","doi":"https://doi.org/10.1109/tc.1984.1676503","title":"An Improved Distribution Algorithm for Shortest Paths Problem","display_name":"An Improved Distribution Algorithm for Shortest Paths Problem","publication_year":1984,"publication_date":"1984-09-01","ids":{"openalex":"https://openalex.org/W2121915725","doi":"https://doi.org/10.1109/tc.1984.1676503","mag":"2121915725"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1984.1676503","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1984.1676503","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5098505404","display_name":"Lakani","orcid":null},"institutions":[{"id":"https://openalex.org/I12315562","display_name":"Texas Tech University","ror":"https://ror.org/0405mnx93","country_code":"US","type":"education","lineage":["https://openalex.org/I12315562"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lakani","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Texas Tech University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Texas Tech University","institution_ids":["https://openalex.org/I12315562"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5098505404"],"corresponding_institution_ids":["https://openalex.org/I12315562"],"apc_list":null,"apc_paid":null,"fwci":1.28,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79782412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"C-33","issue":"9","first_page":"855","last_page":"857"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9948999881744385,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9927999973297119,"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/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.7312842607498169},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7311498522758484},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5860159993171692},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5737171173095703},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5464901924133301},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47135844826698303},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45229849219322205},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4376620054244995},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4053761065006256},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3067863881587982}],"concepts":[{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.7312842607498169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7311498522758484},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5860159993171692},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5737171173095703},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5464901924133301},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47135844826698303},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45229849219322205},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4376620054244995},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4053761065006256},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3067863881587982},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"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.1109/tc.1984.1676503","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1984.1676503","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.4699999988079071,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1989652459","https://openalex.org/W2012667106","https://openalex.org/W2017369466","https://openalex.org/W2085412609","https://openalex.org/W2144050074","https://openalex.org/W2144927306","https://openalex.org/W2150714001"],"related_works":["https://openalex.org/W4283025278","https://openalex.org/W2082432309","https://openalex.org/W817174743","https://openalex.org/W4254559750","https://openalex.org/W2050492524","https://openalex.org/W2998315020","https://openalex.org/W1976665945","https://openalex.org/W3016208414","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"The":[0],"time":[1],"complexity":[2,31],"of":[3],"a":[4,16],"distributed":[5],"algorithm":[6],"[5]":[7],"for":[8],"all-pair":[9],"shortest":[10],"path":[11],"problem":[12],"is":[13,27,32],"improved":[14],"by":[15,19],"factor":[17],"0(n)":[18],"pipelining":[20],"instructions.":[21],"Its":[22],"implementation":[23],"using":[24],"VLSI":[25],"technology":[26],"proposed":[28],"and":[29],"area":[30],"computed.":[33]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-07T14:30:12.667765","created_date":"2025-10-10T00:00:00"}