{"id":"https://openalex.org/W2007572995","doi":"https://doi.org/10.1145/367766.368168","title":"Algorithm 97: Shortest path","display_name":"Algorithm 97: Shortest path","alternate_titles":[],"publication_year":1962,"publication_date":"1962-06-01","ids":{"openalex":"https://openalex.org/W2007572995","doi":"https://doi.org/10.1145/367766.368168","mag":"2007572995"},"language":"en","primary_location":{"id":"doi:10.1145/367766.368168","doi":"https://doi.org/10.1145/367766.368168","is_oa":true,"landing_page_url":"https://doi.org/10.1145/367766.368168","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/367766.368168","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","fnege-3","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2007572995"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/367766.368168","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103503872","display_name":"Robert W. Floyd","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1310264347","display_name":"IIT Research Institute","ror":"https://ror.org/057jp7h82","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1310264347"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Robert W. Floyd","raw_affiliation_strings":["Armour Research Foundation, Chicago, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Armour Research Foundation, Chicago, IL","institution_ids":["https://openalex.org/I1310264347"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103503872"],"corresponding_institution_ids":["https://openalex.org/I1310264347"],"apc_list":null,"apc_paid":null,"fwci":0.5321,"has_fulltext":true,"cited_by_count":4797,"citation_normalized_percentile":{"value":0.59774965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"5","issue":"6","first_page":"345","last_page":"345"},"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.9951000213623047,"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.9951000213623047,"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.003700000001117587,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8769999742507935},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.824999988079071},{"id":"https://openalex.org/keywords/path-finding","display_name":"path finding","score":0.41200000047683716}],"concepts":[{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.6963250637054443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6138359904289246},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5716164112091064},{"id":"https://openalex.org/C2780966255","wikidata":"https://www.wikidata.org/wiki/Q5474306","display_name":"Foundation (evidence)","level":2,"score":0.5562682151794434},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5326732397079468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.489624559879303},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3535831868648529},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.2588425278663635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18508875370025635},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16514238715171814},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15188181400299072},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.12220758199691772},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.07314789295196533},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/367766.368168","doi":"https://doi.org/10.1145/367766.368168","is_oa":true,"landing_page_url":"https://doi.org/10.1145/367766.368168","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/367766.368168","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","fnege-3","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/367766.368168","doi":"https://doi.org/10.1145/367766.368168","is_oa":true,"landing_page_url":"https://doi.org/10.1145/367766.368168","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/367766.368168","source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","fnege-3","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2007572995.pdf","grobid_xml":"https://content.openalex.org/works/W2007572995.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2062400966","https://openalex.org/W2054822857","https://openalex.org/W2058402829","https://openalex.org/W2019501809","https://openalex.org/W1996129280","https://openalex.org/W2006074582","https://openalex.org/W2147338646","https://openalex.org/W1987298952","https://openalex.org/W1979401966","https://openalex.org/W2076910310"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2007572995","counts_by_year":[{"year":2026,"cited_by_count":177},{"year":2025,"cited_by_count":228},{"year":2024,"cited_by_count":250},{"year":2023,"cited_by_count":214},{"year":2022,"cited_by_count":205},{"year":2021,"cited_by_count":233},{"year":2020,"cited_by_count":232},{"year":2019,"cited_by_count":219},{"year":2018,"cited_by_count":228},{"year":2017,"cited_by_count":207},{"year":2016,"cited_by_count":224},{"year":2015,"cited_by_count":206},{"year":2014,"cited_by_count":236},{"year":2013,"cited_by_count":231},{"year":2012,"cited_by_count":189}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
