{"id":"https://openalex.org/W2021537754","doi":"https://doi.org/10.1016/0020-0190(94)90049-3","title":"A shortest-path algorithm for Manhattan graphs","display_name":"A shortest-path algorithm for Manhattan graphs","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2021537754","doi":"https://doi.org/10.1016/0020-0190(94)90049-3","mag":"2021537754"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)90049-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)90049-3","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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 Processing Letters","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/A5071631876","display_name":"Kanchana Kanchanasut","orcid":"https://orcid.org/0000-0001-7025-1671"},"institutions":[{"id":"https://openalex.org/I38538140","display_name":"Asian Institute of Technology","ror":"https://ror.org/0403qcr87","country_code":"TH","type":"education","lineage":["https://openalex.org/I38538140"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Kanchana Kanchanasut","raw_affiliation_strings":["Computer Science Program, Asian Institute of Technology, P.O. Box 2754, Bangkok 10501, Thailand"],"affiliations":[{"raw_affiliation_string":"Computer Science Program, Asian Institute of Technology, P.O. Box 2754, Bangkok 10501, Thailand","institution_ids":["https://openalex.org/I38538140"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071631876"],"corresponding_institution_ids":["https://openalex.org/I38538140"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.4655,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6197433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"49","issue":"1","first_page":"21","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/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/T11269","display_name":"Algorithms and Data Compression","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/combinatorics","display_name":"Combinatorics","score":0.6960351467132568},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.6636452674865723},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.6235642433166504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5171027183532715},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.5142597556114197},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5080511569976807},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4564521312713623},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43327927589416504},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4208550453186035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4153693616390228},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38817402720451355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3752187490463257},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.31955236196517944},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2102321982383728},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17368584871292114},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09979590773582458}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6960351467132568},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.6636452674865723},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.6235642433166504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5171027183532715},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.5142597556114197},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5080511569976807},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4564521312713623},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43327927589416504},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4208550453186035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4153693616390228},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38817402720451355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3752187490463257},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.31955236196517944},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2102321982383728},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17368584871292114},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09979590773582458}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(94)90049-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)90049-3","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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 Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2006385089","https://openalex.org/W2077383738","https://openalex.org/W2095586109","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2064737922","https://openalex.org/W2982283786","https://openalex.org/W2382250366","https://openalex.org/W2749040238","https://openalex.org/W2898116945","https://openalex.org/W2963498914","https://openalex.org/W1778198164","https://openalex.org/W4289363180","https://openalex.org/W2794508120","https://openalex.org/W2296996162"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}