{"id":"https://openalex.org/W2021542397","doi":"https://doi.org/10.1016/0890-5401(90)90051-i","title":"A distributed shortest path algorithm for a planar network","display_name":"A distributed shortest path algorithm for a planar network","publication_year":1990,"publication_date":"1990-06-01","ids":{"openalex":"https://openalex.org/W2021542397","doi":"https://doi.org/10.1016/0890-5401(90)90051-i","mag":"2021542397"},"language":"en","primary_location":{"id":"doi:10.1016/0890-5401(90)90051-i","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0890-5401(90)90051-i","pdf_url":null,"source":{"id":"https://openalex.org/S59933527","display_name":"Information and Computation","issn_l":"0890-5401","issn":["0890-5401","1090-2651"],"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":"Information and Computation","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/A5015188847","display_name":"Greg N. Frederickson","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg N. Frederickson","raw_affiliation_strings":["Department of Computer Sciences Purdue University, West Lafayette, Indiana 47907, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences Purdue University, West Lafayette, Indiana 47907, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015188847"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":{"value":2630,"currency":"USD","value_usd":2630},"apc_paid":null,"fwci":1.0815,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.76596832,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"86","issue":"2","first_page":"140","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9918000102043152,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6680851578712463},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6666239500045776},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5715847015380859},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5591520667076111},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5539853572845459},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4310716688632965},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2569889426231384},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1523182988166809},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1456977128982544}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6680851578712463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6666239500045776},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5715847015380859},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5591520667076111},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5539853572845459},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4310716688632965},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2569889426231384},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1523182988166809},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1456977128982544},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0890-5401(90)90051-i","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0890-5401(90)90051-i","pdf_url":null,"source":{"id":"https://openalex.org/S59933527","display_name":"Information and Computation","issn_l":"0890-5401","issn":["0890-5401","1090-2651"],"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":"Information and Computation","raw_type":"journal-article"},{"id":"pmh:oai:docs.lib.purdue.edu:cstech-1445","is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/cstech/446","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science Technical Reports","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1484571534","https://openalex.org/W1498585861","https://openalex.org/W1982180670","https://openalex.org/W2022980325","https://openalex.org/W2038643780","https://openalex.org/W2059015573","https://openalex.org/W2077371116","https://openalex.org/W2077486819","https://openalex.org/W2120424341","https://openalex.org/W2169528473","https://openalex.org/W2799004609","https://openalex.org/W6628921065","https://openalex.org/W6629806530","https://openalex.org/W6669549890"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2349797546","https://openalex.org/W2161960576","https://openalex.org/W2366342492"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}