{"id":"https://openalex.org/W2054695963","doi":"https://doi.org/10.1007/bf01949715","title":"Cost-minimal trees in directed acyclic graphs","display_name":"Cost-minimal trees in directed acyclic graphs","publication_year":1974,"publication_date":"1974-02-01","ids":{"openalex":"https://openalex.org/W2054695963","doi":"https://doi.org/10.1007/bf01949715","mag":"2054695963"},"language":"en","primary_location":{"id":"doi:10.1007/bf01949715","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01949715","pdf_url":null,"source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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":"Zeitschrift f\u00fcr Operations Research","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/A5014016033","display_name":"Ludwig Nastansky","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"L. Nastansky","raw_affiliation_strings":["Fachbereich Wirtschaftswissenschaften, Universit\u00e4t des Saarlandes, 66 Saarbr\u00fccken, W-Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich Wirtschaftswissenschaften, Universit\u00e4t des Saarlandes, 66 Saarbr\u00fccken, W-Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056268263","display_name":"Stanley M. Selkow","orcid":null},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"S. M. Selkow","raw_affiliation_strings":["D\u00e9partment d'informatique, Universit\u00e9 de Montr\u00e9al, C. P. 6128, Montr\u00e9al 101, P. Q., Canada","D\u00e9partment d'informatique, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al 101, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partment d'informatique, Universit\u00e9 de Montr\u00e9al, C. P. 6128, Montr\u00e9al 101, P. Q., Canada","institution_ids":["https://openalex.org/I70931966"]},{"raw_affiliation_string":"D\u00e9partment d'informatique, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al 101, Canada","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103985974","display_name":"Nathaniel Stewart","orcid":null},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"N. F. Stewart","raw_affiliation_strings":["D\u00e9partment d'informatique, Universit\u00e9 de Montr\u00e9al, C. P. 6128, Montr\u00e9al 101, P. Q., Canada","D\u00e9partment d'informatique, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al 101, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partment d'informatique, Universit\u00e9 de Montr\u00e9al, C. P. 6128, Montr\u00e9al 101, P. Q., Canada","institution_ids":["https://openalex.org/I70931966"]},{"raw_affiliation_string":"D\u00e9partment d'informatique, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al 101, Canada","institution_ids":["https://openalex.org/I70931966"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5907,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.65860465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"18","issue":"1","first_page":"59","last_page":"67"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9959999918937683,"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/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.732181191444397},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5972750782966614},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.5956397652626038},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4971945583820343},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4619292616844177},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4619034230709076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4557501971721649},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4431177079677582},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.4374709725379944},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4278334677219391},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3928055465221405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3613321781158447},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.30125725269317627},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.20692658424377441}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.732181191444397},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5972750782966614},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.5956397652626038},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4971945583820343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4619292616844177},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4619034230709076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4557501971721649},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4431177079677582},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.4374709725379944},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4278334677219391},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3928055465221405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3613321781158447},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.30125725269317627},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.20692658424377441},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01949715","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01949715","pdf_url":null,"source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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":"Zeitschrift f\u00fcr Operations Research","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":11,"referenced_works":["https://openalex.org/W1974323594","https://openalex.org/W1990488643","https://openalex.org/W1996668544","https://openalex.org/W2042477130","https://openalex.org/W2064086982","https://openalex.org/W2064791171","https://openalex.org/W2086709935","https://openalex.org/W2093150123","https://openalex.org/W2100890245","https://openalex.org/W2120653759","https://openalex.org/W2132087752"],"related_works":["https://openalex.org/W4287028074","https://openalex.org/W2354764436","https://openalex.org/W3191289342","https://openalex.org/W4288723498","https://openalex.org/W4292730466","https://openalex.org/W2350111251","https://openalex.org/W4297817344","https://openalex.org/W2555805899","https://openalex.org/W1512669878","https://openalex.org/W2603633312"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}