{"id":"https://openalex.org/W2006385089","doi":"https://doi.org/10.1002/net.3230070404","title":"A shortest path algorithm for grid graphs","display_name":"A shortest path algorithm for grid graphs","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W2006385089","doi":"https://doi.org/10.1002/net.3230070404","mag":"2006385089"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230070404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230070404","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5020223730","display_name":"Frank Hadlock","orcid":null},"institutions":[{"id":"https://openalex.org/I63772739","display_name":"Florida Atlantic University","ror":"https://ror.org/05p8w6387","country_code":"US","type":"education","lineage":["https://openalex.org/I63772739"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. O. Hadlock","raw_affiliation_strings":["Florida Atlantic University Boca Raton, Florida","Florida Atlantic University Boca , Raton, Florida"],"affiliations":[{"raw_affiliation_string":"Florida Atlantic University Boca Raton, Florida","institution_ids":["https://openalex.org/I63772739"]},{"raw_affiliation_string":"Florida Atlantic University Boca , Raton, Florida","institution_ids":["https://openalex.org/I63772739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020223730"],"corresponding_institution_ids":["https://openalex.org/I63772739"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.1035,"has_fulltext":false,"cited_by_count":128,"citation_normalized_percentile":{"value":0.90279807,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"7","issue":"4","first_page":"323","last_page":"334"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9977999925613403,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9943000078201294,"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.70802903175354},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6269426941871643},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6044068932533264},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5762516260147095},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5354324579238892},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5342734456062317},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5304191708564758},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.49613794684410095},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.48034560680389404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47727957367897034},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.4479241371154785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4459880590438843},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.43419113755226135},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4314073324203491},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4278007745742798},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.421589732170105},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4135957956314087},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3764111399650574},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3249044418334961},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.25135937333106995},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10984867811203003},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.05716302990913391}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.70802903175354},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6269426941871643},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6044068932533264},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5762516260147095},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5354324579238892},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5342734456062317},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5304191708564758},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.49613794684410095},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.48034560680389404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47727957367897034},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.4479241371154785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4459880590438843},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.43419113755226135},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4314073324203491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4278007745742798},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.421589732170105},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4135957956314087},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3764111399650574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3249044418334961},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.25135937333106995},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10984867811203003},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.05716302990913391},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230070404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230070404","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8199999928474426,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W1990141217","https://openalex.org/W2095586109","https://openalex.org/W2144050074","https://openalex.org/W2153580689","https://openalex.org/W2169528473","https://openalex.org/W2172152477","https://openalex.org/W3138807513","https://openalex.org/W4252785721","https://openalex.org/W4302399279","https://openalex.org/W6792319920"],"related_works":["https://openalex.org/W2237480599","https://openalex.org/W2133099431","https://openalex.org/W2002764510","https://openalex.org/W2018146256","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2612665926","https://openalex.org/W2183791707","https://openalex.org/W2779966368","https://openalex.org/W4294360851"],"abstract_inverted_index":{"Abstract":[0],"Grid":[1,34],"graphs":[2,9,35],"are":[3,80,90],"a":[4,56,74],"simple":[5],"class":[6],"of":[7,43,49,77,81,91,108,111],"planar":[8],"for":[10,69],"which":[11,121],"the":[12,31,40,70,94,109,125,131],"vertices":[13,62,79],"can":[14,97],"be":[15,98],"assigned":[16],"integer":[17],"coordinates":[18],"so":[19],"that":[20],"neighbors":[21],"agree":[22],"in":[23,30,37,73,100,114,124,130],"one":[24,29],"coordinate":[25],"and":[26,128],"differ":[27],"by":[28],"other":[32],"coordinate.":[33],"arise":[36],"applications":[38],"from":[39],"layout":[41],"design":[42],"integrated":[44],"circuits":[45],"to":[46],"idealized":[47],"models":[48],"city":[50],"street":[51],"networks.":[52],"In":[53,103],"many":[54],"applications,":[55],"shortest":[57,71,95],"path":[58,72,96],"between":[59],"two":[60],"given":[61],"is":[63,119,122],"needed.":[64],"The":[65],"best":[66,132],"known":[67],"algorithms":[68],"general":[75],"graph":[76],"n":[78],"complexity":[82],"0(n":[83],"2":[84],").":[85],"However,":[86],"if":[87],"edge":[88],"lengths":[89],"uniform":[92],"length,":[93],"determined":[99],"time":[101],"0(n).":[102],"this":[104],"paper,":[105],"taking":[106],"advantage":[107],"concept":[110],"direction":[112],"present":[113],"grid":[115],"graphs,":[116],"an":[117],"algorithm":[118],"developed":[120],"0(n)":[123],"worst":[126],"case":[127],"0(\u221an)":[129],"case.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}