{"id":"https://openalex.org/W314152838","doi":"https://doi.org/10.21236/ada059838","title":"A Distributed Shortest - Path Algorithm","display_name":"A Distributed Shortest - Path Algorithm","publication_year":1978,"publication_date":"1978-09-01","ids":{"openalex":"https://openalex.org/W314152838","doi":"https://doi.org/10.21236/ada059838","mag":"314152838"},"language":"en","primary_location":{"id":"doi:10.21236/ada059838","doi":"https://doi.org/10.21236/ada059838","is_oa":false,"landing_page_url":"http://doi.org/10.21236/ada059838","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"US Dept of the Navy","raw_type":"report"},"volume":null,"type":"report","is_traditional":false,"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/A5038437382","display_name":"P.A. Humblet","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pierre A. Humblet","raw_affiliation_strings":["Massachusetts Institute of Technology Electronic Systems Laboratory Room 35-203 Cambridge, Mass. 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology Electronic Systems Laboratory Room 35-203 Cambridge, Mass. 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038437382"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.7602999806404114,"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.7602999806404114,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.20170000195503235,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.003599999938160181,"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/network-routing","display_name":"network routing","score":0.8059999942779541},{"id":"https://openalex.org/keywords/computer-networks","display_name":"computer networks","score":0.8330000042915344},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.6039999723434448},{"id":"https://openalex.org/keywords/node-cooperation","display_name":"node cooperation","score":0.5799999833106995}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5791738033294678},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5671899318695068},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5495726466178894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48338738083839417},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23523792624473572},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0766039490699768},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.03979340195655823}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.21236/ada059838","doi":"https://doi.org/10.21236/ada059838","is_oa":false,"landing_page_url":"http://doi.org/10.21236/ada059838","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"US Dept of the Navy","raw_type":"report"},{"id":"pmh:oai:repository.arizona.edu:10150/609766","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/10150/609766","pdf_url":null,"source":{"id":"https://openalex.org/S4306400271","display_name":"UA Campus Repository (The University of Arizona)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I138006243","host_organization_name":"University of Arizona","host_organization_lineage":["https://openalex.org/I138006243"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4943999946117401}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306078","display_name":"U.S. Department of Defense","ror":"https://ror.org/0447fe631"},{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W42546367","https://openalex.org/W2028427248","https://openalex.org/W2092330486","https://openalex.org/W2125690626","https://openalex.org/W2125719434","https://openalex.org/W2143418448","https://openalex.org/W2144014315","https://openalex.org/W4250871362"],"related_works":["https://openalex.org/W188705541","https://openalex.org/W2728019715","https://openalex.org/W1564616765","https://openalex.org/W356512","https://openalex.org/W2543847065","https://openalex.org/W6981216124","https://openalex.org/W3173365511","https://openalex.org/W1638040061","https://openalex.org/W54562852","https://openalex.org/W4256400132"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,19,70],"routing":[3,23],"in":[4,44,56,72],"a":[5,41,78],"data":[6],"network":[7,21,64],"is":[8],"often":[9],"treated":[10],"by":[11,80],"assigning":[12],"traffic":[13,24],"dependent":[14],"lengths":[15],"to":[16,28,37,49,75],"the":[17,20,32,46,63,68,73,81],"links":[18],"and":[22,59],"from":[25,35],"node":[26,29,58],"i":[27,36],"j":[30,38],"along":[31],"shortest":[33,52],"path":[34],".We":[39],"present":[40],"distributed":[42],"algorithm":[43],"which":[45],"nodes":[47,71],"cooperate":[48],"find":[50],"all":[51],"paths.It":[53],"runs":[54],"asynchronously":[55],"every":[57],"does":[60],"not":[61],"require":[62],"topology,":[65],"or":[66],"even":[67],"number":[69],"network,":[74],"be":[76],"known":[77],"priori":[79],"nodes.":[82]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2016-06-24T00:00:00"}