{"id":"https://openalex.org/W2164485560","doi":"https://doi.org/10.1016/s0022-0000(05)80064-9","title":"Trans-dichotomous algorithms for minimum spanning trees and shortest paths","display_name":"Trans-dichotomous algorithms for minimum spanning trees and shortest paths","publication_year":1994,"publication_date":"1994-06-01","ids":{"openalex":"https://openalex.org/W2164485560","doi":"https://doi.org/10.1016/s0022-0000(05)80064-9","mag":"2164485560"},"language":"en","primary_location":{"id":"doi:10.1016/s0022-0000(05)80064-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(05)80064-9","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","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/A5072449512","display_name":"Michael L. Fredman","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael L. Fredman","raw_affiliation_strings":["University of California at San Diego, La Jolla, California 92093, and Rutgers University, New Brunswick, New Jersey 08903, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at San Diego, La Jolla, California 92093, and Rutgers University, New Brunswick, New Jersey 08903, USA","institution_ids":["https://openalex.org/I102322142","https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074770137","display_name":"Dan E. Willard","orcid":null},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan E. Willard","raw_affiliation_strings":["SUNY at Albany, Albany, New York 12203, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SUNY at Albany, Albany, New York 12203, USA","institution_ids":["https://openalex.org/I392282"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2610,"currency":"USD","value_usd":2610},"apc_paid":null,"fwci":13.4586,"has_fulltext":false,"cited_by_count":421,"citation_normalized_percentile":{"value":0.99408878,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"48","issue":"3","first_page":"533","last_page":"551"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6826055645942688},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.641938328742981},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5958740711212158},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5555802583694458},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5543481707572937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5362403392791748},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.524192750453949},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5174699425697327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5156010985374451},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.496081680059433},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.47004786133766174},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4698471128940582},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46169766783714294},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.4440658390522003},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.43769535422325134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37733227014541626},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.361929714679718}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6826055645942688},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.641938328742981},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5958740711212158},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5555802583694458},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5543481707572937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5362403392791748},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.524192750453949},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5174699425697327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5156010985374451},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.496081680059433},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.47004786133766174},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4698471128940582},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46169766783714294},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.4440658390522003},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.43769535422325134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37733227014541626},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.361929714679718}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0022-0000(05)80064-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(05)80064-9","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1531368347","https://openalex.org/W1982512167","https://openalex.org/W2007683581","https://openalex.org/W2059985428","https://openalex.org/W2063301486","https://openalex.org/W2074286662","https://openalex.org/W2084224084","https://openalex.org/W2090747326","https://openalex.org/W2098755772","https://openalex.org/W2152506249","https://openalex.org/W2160365857","https://openalex.org/W4245266864","https://openalex.org/W6652647605","https://openalex.org/W6665422471","https://openalex.org/W6674439079"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W4380840098","https://openalex.org/W2390742649","https://openalex.org/W3016811403","https://openalex.org/W2899787781","https://openalex.org/W1492843964","https://openalex.org/W3214318512","https://openalex.org/W3199950654","https://openalex.org/W3010298256","https://openalex.org/W4381745661"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":25},{"year":2013,"cited_by_count":36},{"year":2012,"cited_by_count":24}],"updated_date":"2026-08-25T07:29:55.448023","created_date":"2025-10-10T00:00:00"}