{"id":"https://openalex.org/W1967957610","doi":"https://doi.org/10.1016/0166-218x(83)90014-8","title":"On the complexity of finding multi-constrained spanning trees","display_name":"On the complexity of finding multi-constrained spanning trees","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W1967957610","doi":"https://doi.org/10.1016/0166-218x(83)90014-8","mag":"1967957610"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(83)90014-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(83)90014-8","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","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/A5103501699","display_name":"P. M. Camerini","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"P.M. Camerini","raw_affiliation_strings":["Centro di Studi per le Telecomunicazioni Spaziali of CNR, Politecnico di Milano, 20133 Milano Italy"],"affiliations":[{"raw_affiliation_string":"Centro di Studi per le Telecomunicazioni Spaziali of CNR, Politecnico di Milano, 20133 Milano Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012585989","display_name":"Giulia Galbiati","orcid":null},"institutions":[{"id":"https://openalex.org/I25217355","display_name":"University of Pavia","ror":"https://ror.org/00s6t1f81","country_code":"IT","type":"education","lineage":["https://openalex.org/I25217355"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. Galbiati","raw_affiliation_strings":["Istituto di Matematica, Universit\u00e0 di Pavia, 27100 Pavia, Italy"],"affiliations":[{"raw_affiliation_string":"Istituto di Matematica, Universit\u00e0 di Pavia, 27100 Pavia, Italy","institution_ids":["https://openalex.org/I25217355"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053677027","display_name":"Francesco Maffioli","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"F. Maffioli","raw_affiliation_strings":["Dipartimento di Elettronica and Centro di Studi per le Telecomunicazioni Spaziali of CNR Politecnico di Milano, 20133 Milano, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica and Centro di Studi per le Telecomunicazioni Spaziali of CNR Politecnico di Milano, 20133 Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103501699"],"corresponding_institution_ids":["https://openalex.org/I93860229"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":2.2692,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.86408771,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"5","issue":"1","first_page":"39","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"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.996999979019165,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9957000017166138,"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/T11106","display_name":"Data Management and Algorithms","score":0.9927999973297119,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8326430320739746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7888617515563965},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6624282598495483},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6220910549163818},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5454394221305847},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.49538886547088623},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4727628827095032},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.44926995038986206},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4322412610054016},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.42149507999420166},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41603001952171326},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.399441659450531},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.22879955172538757},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18121179938316345},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.174818217754364},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.12775185704231262}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8326430320739746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7888617515563965},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6624282598495483},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6220910549163818},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5454394221305847},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.49538886547088623},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4727628827095032},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.44926995038986206},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4322412610054016},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.42149507999420166},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41603001952171326},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.399441659450531},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.22879955172538757},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18121179938316345},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.174818217754364},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.12775185704231262}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0166-218x(83)90014-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(83)90014-8","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","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":4,"referenced_works":["https://openalex.org/W2064733879","https://openalex.org/W2072970829","https://openalex.org/W3138807513","https://openalex.org/W6792319920"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W4380840098","https://openalex.org/W2138987445","https://openalex.org/W3016811403","https://openalex.org/W2048177396","https://openalex.org/W2014991506","https://openalex.org/W2387385213","https://openalex.org/W1985149601","https://openalex.org/W2069643240","https://openalex.org/W620960161"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}