{"id":"https://openalex.org/W2019834939","doi":"https://doi.org/10.1016/0196-6774(87)90042-3","title":"Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs","display_name":"Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs","publication_year":1987,"publication_date":"1987-06-01","ids":{"openalex":"https://openalex.org/W2019834939","doi":"https://doi.org/10.1016/0196-6774(87)90042-3","mag":"2019834939"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(87)90042-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(87)90042-3","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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/A5023556977","display_name":"Thomas Lengauer","orcid":"https://orcid.org/0000-0003-3801-2640"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"T Lengauer","raw_affiliation_strings":["Fachbereich 17, University of Paderborn, 4790 Paderborn, West Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich 17, University of Paderborn, 4790 Paderborn, West Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023556977"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":4.2603,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.9451896,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":"2","first_page":"260","last_page":"284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9980000257492065,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9959999918937683,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7248712182044983},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7196903824806213},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6200196146965027},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5441727042198181},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5189216136932373},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4614405035972595},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4264652729034424},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4240912199020386},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.41964563727378845},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4170565605163574},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37673285603523254},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35911083221435547}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7248712182044983},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7196903824806213},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6200196146965027},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5441727042198181},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5189216136932373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4614405035972595},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4264652729034424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4240912199020386},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.41964563727378845},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4170565605163574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37673285603523254},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35911083221435547},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0196-6774(87)90042-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(87)90042-3","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1492810367","https://openalex.org/W1513363723","https://openalex.org/W1513400187","https://openalex.org/W1527768578","https://openalex.org/W1784253675","https://openalex.org/W1982512167","https://openalex.org/W2011039300","https://openalex.org/W2022486658","https://openalex.org/W2087236465","https://openalex.org/W2160517890","https://openalex.org/W6630562636","https://openalex.org/W6631632589","https://openalex.org/W6638391631","https://openalex.org/W6655952354","https://openalex.org/W6672184946"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W4206043061","https://openalex.org/W2942013815","https://openalex.org/W2387385213","https://openalex.org/W4242086819","https://openalex.org/W2074214908","https://openalex.org/W2138987445","https://openalex.org/W1842018596","https://openalex.org/W4302939663"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}