{"id":"https://openalex.org/W1966557890","doi":"https://doi.org/10.1002/net.3230170308","title":"Computing <i>k</i>\u2010shortest path lengths in euclidean networks","display_name":"Computing <i>k</i>\u2010shortest path lengths in euclidean networks","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W1966557890","doi":"https://doi.org/10.1002/net.3230170308","mag":"1966557890"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170308","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170308","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/A5083079670","display_name":"Christopher C. Ski\u015bcim","orcid":null},"institutions":[{"id":"https://openalex.org/I44896327","display_name":"Mitre (United States)","ror":"https://ror.org/03ks2a131","country_code":"US","type":"company","lineage":["https://openalex.org/I44896327"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Christopher C. Skiscim","raw_affiliation_strings":["The MITRE Corporation, McLean, Virginia 22101","The Mitre Corporation, McLean, Virginia 22101"],"affiliations":[{"raw_affiliation_string":"The MITRE Corporation, McLean, Virginia 22101","institution_ids":["https://openalex.org/I44896327"]},{"raw_affiliation_string":"The Mitre Corporation, McLean, Virginia 22101","institution_ids":["https://openalex.org/I44896327"]}]},{"author_position":"last","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":false,"raw_author_name":"Bruce L. Golden","raw_affiliation_strings":["College of Business and Management, The University of Maryland, College Park, Maryland 20742"],"affiliations":[{"raw_affiliation_string":"College of Business and Management, The University of Maryland, College Park, Maryland 20742","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083079670"],"corresponding_institution_ids":["https://openalex.org/I44896327"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.57845233,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.63505747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"17","issue":"3","first_page":"341","last_page":"352"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9927999973297119,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9711999893188477,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8491621613502502},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6947854161262512},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6478403806686401},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5828045606613159},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5537447333335876},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5384049415588379},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5356281399726868},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49787068367004395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4733032286167145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4612281620502472},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.4562898278236389},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4469625949859619},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4399205148220062},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3936934471130371},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1604856252670288},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07101473212242126},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.056915283203125},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.046735525131225586}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8491621613502502},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6947854161262512},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6478403806686401},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5828045606613159},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5537447333335876},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5384049415588379},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5356281399726868},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49787068367004395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4733032286167145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4612281620502472},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4562898278236389},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4469625949859619},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4399205148220062},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3936934471130371},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1604856252670288},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07101473212242126},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.056915283203125},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.046735525131225586},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230170308","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170308","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":6,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1969483458","https://openalex.org/W1973804680","https://openalex.org/W2052431439","https://openalex.org/W2077383738","https://openalex.org/W2154672625"],"related_works":["https://openalex.org/W3088868185","https://openalex.org/W2886722595","https://openalex.org/W2990531685","https://openalex.org/W4310124294","https://openalex.org/W78690942","https://openalex.org/W2377950158","https://openalex.org/W2170980056","https://openalex.org/W2383519316","https://openalex.org/W2363342665","https://openalex.org/W4310271105"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper,":[3],"we":[4],"examine":[5],"the":[6,36,39,54,60,68],"problem":[7],"of":[8,25,38,46,70],"finding":[9],"k":[10,52],"\u2010shortest":[11],"paths":[12],"between":[13],"an":[14],"origin":[15],"and":[16,53],"destination":[17],"pair":[18],"when":[19],"distances":[20],"are":[21,30],"Euclidean.":[22],"Two":[23],"versions":[24],"a":[26,64],"generalized":[27],"Dijkstra":[28],"algorithm":[29,62],"compared.":[31],"Computational":[32],"results":[33],"show":[34],"that":[35],"advantage":[37,66],"adaptive":[40,61],"version":[41],"(measured":[42],"by":[43],"total":[44],"number":[45,69],"permanent":[47,71],"labels)":[48],"grows":[49],"with":[50],"both":[51],"network":[55],"size.":[56],"For":[57],"large":[58],"networks,":[59],"exhibits":[63],"100:1":[65],"in":[67],"labels":[72],"set.":[73]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}