{"id":"https://openalex.org/W2077383738","doi":"https://doi.org/10.1007/bf01840435","title":"Shortest paths in euclidean graphs","display_name":"Shortest paths in euclidean graphs","publication_year":1986,"publication_date":"1986-11-01","ids":{"openalex":"https://openalex.org/W2077383738","doi":"https://doi.org/10.1007/bf01840435","mag":"2077383738"},"language":"en","primary_location":{"id":"doi:10.1007/bf01840435","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01840435","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5077370067","display_name":"Robert Sedgewick","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Sedgewick","raw_affiliation_strings":["Department of Computer Science, Brown University, 02912, Providence, RI, USA","Brown University, Providence, RI,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, 02912, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Providence, RI,","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003340402","display_name":"Jeffrey Scott Vitter","orcid":"https://orcid.org/0000-0001-7970-6118"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey Scott Vitter","raw_affiliation_strings":["Department of Computer Science, Brown University, 02912, Providence, RI, USA","Brown University, Providence, RI,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, 02912, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Providence, RI,","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.1054,"has_fulltext":false,"cited_by_count":128,"citation_normalized_percentile":{"value":0.94080997,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"1","issue":"1-4","first_page":"31","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T10799","display_name":"Data Visualization and Analytics","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7878827452659607},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.6923359036445618},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6318341493606567},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.6144251823425293},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5944193005561829},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.47650137543678284},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4661833941936493},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4454805254936218},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4300433397293091},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3794805705547333},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.24717041850090027},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.23021358251571655},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20418515801429749},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05356103181838989}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7878827452659607},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.6923359036445618},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6318341493606567},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.6144251823425293},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5944193005561829},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.47650137543678284},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4661833941936493},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4454805254936218},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4300433397293091},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3794805705547333},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.24717041850090027},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.23021358251571655},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20418515801429749},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05356103181838989}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01840435","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01840435","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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":16,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1595943972","https://openalex.org/W1655990431","https://openalex.org/W1967121312","https://openalex.org/W1969483458","https://openalex.org/W2002722920","https://openalex.org/W2031671531","https://openalex.org/W2091323212","https://openalex.org/W2113906664","https://openalex.org/W2154672625","https://openalex.org/W2163169902","https://openalex.org/W2169528473","https://openalex.org/W2798461040","https://openalex.org/W2929495866","https://openalex.org/W6637190722","https://openalex.org/W6761603039"],"related_works":["https://openalex.org/W2363342665","https://openalex.org/W2018146256","https://openalex.org/W2237480599","https://openalex.org/W2578319993","https://openalex.org/W2368688974","https://openalex.org/W2347245430","https://openalex.org/W2099686509","https://openalex.org/W2379804627","https://openalex.org/W3149063625","https://openalex.org/W2170980056"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}