{"id":"https://openalex.org/W2078199146","doi":"https://doi.org/10.1007/bf01187017","title":"A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs","display_name":"A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs","publication_year":1994,"publication_date":"1994-04-01","ids":{"openalex":"https://openalex.org/W2078199146","doi":"https://doi.org/10.1007/bf01187017","mag":"2078199146"},"language":"en","primary_location":{"id":"doi:10.1007/bf01187017","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01187017","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/A5050592570","display_name":"Heather Booth","orcid":null},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Heather Booth","raw_affiliation_strings":["Department of Computer Science, University of Tennessee, 37996, Knoxville, TN, USA","Department of Computer Science, University of Tennessee, Knoxville, USA 37996#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Tennessee, 37996, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]},{"raw_affiliation_string":"Department of Computer Science, University of Tennessee, Knoxville, USA 37996#TAB#","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034718361","display_name":"Jeffery Westbrook","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffery Westbrook","raw_affiliation_strings":["Department of Computer Science, Yale University, 06520-2158, New Haven, CT, USA","Department of Computer Science, Yale University, New Haven, USA 06520-2158#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, 06520-2158, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Department of Computer Science, Yale University, New Haven, USA 06520-2158#TAB#","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050592570"],"corresponding_institution_ids":["https://openalex.org/I75027704"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.9272,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.75815442,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"4","first_page":"341","last_page":"352"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9973000288009644,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6325781345367432},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5758330821990967},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5664387345314026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5229307413101196},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4782772958278656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37568140029907227},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27654799818992615},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27422910928726196}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6325781345367432},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5758330821990967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5664387345314026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5229307413101196},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4782772958278656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37568140029907227},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27654799818992615},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27422910928726196}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01187017","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01187017","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.3259","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.3259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/HTML/YALE/CS/HyPlans/westbrook/sensitivity-planar.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1554127434","https://openalex.org/W1579194992","https://openalex.org/W1964700557","https://openalex.org/W1978099551","https://openalex.org/W1987374783","https://openalex.org/W2022363559","https://openalex.org/W2023658462","https://openalex.org/W2024491681","https://openalex.org/W2038643780","https://openalex.org/W2048500523","https://openalex.org/W2049105156","https://openalex.org/W2051750343","https://openalex.org/W2054420170","https://openalex.org/W2094632707","https://openalex.org/W2118382442","https://openalex.org/W2121473031","https://openalex.org/W2128865241","https://openalex.org/W2157128732","https://openalex.org/W2799004609","https://openalex.org/W6629172744","https://openalex.org/W6836982560"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W2390742649","https://openalex.org/W3101281637","https://openalex.org/W1561849181"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}