{"id":"https://openalex.org/W2154672625","doi":"https://doi.org/10.1002/net.3230080404","title":"Shortest paths with euclidean distances: An explanatory model","display_name":"Shortest paths with euclidean distances: An explanatory model","publication_year":1978,"publication_date":"1978-12-01","ids":{"openalex":"https://openalex.org/W2154672625","doi":"https://doi.org/10.1002/net.3230080404","mag":"2154672625"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230080404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080404","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/A5022968381","display_name":"Bruce Golden","orcid":"https://orcid.org/0000-0002-5270-6094"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. L. Golden","raw_affiliation_strings":["University of Maryland College Park, Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland College Park, Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035102045","display_name":"Michael O. Ball","orcid":"https://orcid.org/0000-0003-2757-8569"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Ball","raw_affiliation_strings":["Bell Laboratories Holmdel, New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories Holmdel, New Jersey","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022968381"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.7409,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.72544081,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"4","first_page":"297","last_page":"314"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8726416826248169},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.6438308954238892},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.6379610300064087},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.6145069599151611},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6067025661468506},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5849965214729309},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5778748393058777},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.574299156665802},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5449265241622925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5002744197845459},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46956801414489746},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4629920423030853},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.44993168115615845},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4317304193973541},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.344955712556839},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3376489281654358},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3203624486923218},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15432146191596985},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10250091552734375},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0675424337387085}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8726416826248169},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.6438308954238892},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6379610300064087},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.6145069599151611},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6067025661468506},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5849965214729309},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5778748393058777},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.574299156665802},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5449265241622925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5002744197845459},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46956801414489746},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4629920423030853},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.44993168115615845},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4317304193973541},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.344955712556839},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3376489281654358},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3203624486923218},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15432146191596985},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10250091552734375},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0675424337387085}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230080404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080404","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2000687208","https://openalex.org/W2035601288","https://openalex.org/W2056084425","https://openalex.org/W2144050074","https://openalex.org/W2160645305","https://openalex.org/W2602708169"],"related_works":["https://openalex.org/W2136320479","https://openalex.org/W2377950158","https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2348287729","https://openalex.org/W1562631103","https://openalex.org/W2383519316","https://openalex.org/W81100512","https://openalex.org/W2367364991","https://openalex.org/W2734981231"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"considers":[3],"the":[4,8,46,63,65,72,79,84],"problem":[5],"of":[6,31,55],"finding":[7],"shortest":[9],"path":[10],"between":[11],"an":[12],"origin":[13],"and":[14,27,82],"destination":[15],"pair":[16],"in":[17,83],"networks":[18],"whose":[19],"arc":[20],"lengths":[21],"are":[22,41],"Euclidean":[23,59],"distances.":[24],"Dijkstra's":[25,32],"algorithm":[26,33,67,81],"a":[28],"modified":[29],"version":[30],"which":[34],"is":[35],"more":[36,56,99],"adaptive":[37,66],"to":[38],"network":[39,49],"topology":[40],"compared.":[42],"We":[43],"demonstrate":[44],"on":[45,62],"infinite":[47],"lattice":[48],"with":[50],"diagonal":[51],"arcs":[52],"(a":[53],"prototype":[54],"general":[57,100],"sparse":[58],"networks)":[60],"that":[61,74],"average":[64],"expands":[68,88],"less":[69,89],"than":[70,90],"8.3%":[71],"area":[73],"would":[75],"be":[76],"expanded":[77],"by":[78],"Dijkstra":[80],"worst":[85],"case":[86],"it":[87],"10.7%.":[91],"In":[92],"addition,":[93],"we":[94],"present":[95],"computational":[96],"results":[97],"for":[98],"networks.":[101]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}