{"id":"https://openalex.org/W2033250446","doi":"https://doi.org/10.1002/net.3230080304","title":"A good algorithm for smallest spanning trees with a degree constraint","display_name":"A good algorithm for smallest spanning trees with a degree constraint","publication_year":1978,"publication_date":"1978-09-01","ids":{"openalex":"https://openalex.org/W2033250446","doi":"https://doi.org/10.1002/net.3230080304","mag":"2033250446"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230080304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080304","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"H. N. Gabow","raw_affiliation_strings":["University of Colorado at Boulder Boulder, Colorado","University of Colorado at Boulder, Boulder Colorado"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Colorado at Boulder Boulder, Colorado","institution_ids":[]},{"raw_affiliation_string":"University of Colorado at Boulder, Boulder Colorado","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001013961"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.5811,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.8364736,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"8","issue":"3","first_page":"201","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9980000257492065,"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/spanning-tree","display_name":"Spanning tree","score":0.7521459460258484},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6688739061355591},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6532297134399414},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6004794239997864},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5246710777282715},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49965906143188477},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4640677571296692},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4480026662349701},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4414956867694855},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4372609257698059},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4356299936771393},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36591702699661255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34120941162109375}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7521459460258484},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6688739061355591},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6532297134399414},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6004794239997864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5246710777282715},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49965906143188477},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4640677571296692},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4480026662349701},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4414956867694855},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4372609257698059},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4356299936771393},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36591702699661255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34120941162109375},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230080304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080304","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1550550959","https://openalex.org/W1655990431","https://openalex.org/W1965680834","https://openalex.org/W1972674272","https://openalex.org/W1973942323","https://openalex.org/W1988615825","https://openalex.org/W2047517090","https://openalex.org/W2071845176","https://openalex.org/W2128865241"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4242086819","https://openalex.org/W2943635264","https://openalex.org/W2387385213","https://openalex.org/W2074214908","https://openalex.org/W2138987445","https://openalex.org/W4308416203","https://openalex.org/W1842018596"],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"a":[2,10,14,68],"connected":[3],"graph":[4],"with":[5,21],"edge":[6,31,63],"costs,":[7],"we":[8,39],"seek":[9],"spanning":[11,78],"tree":[12],"having":[13],"specified":[15],"degree":[16],"at":[17],"one":[18],"vertex":[19],"r,":[20],"cost":[22],"as":[23,25],"small":[24],"possible.":[26],"A":[27],"previous":[28],"algorithm,":[29],"using":[30],"exchanges,":[32],"has":[33],"run":[34],"time":[35],"0(V":[36],"2":[37],");":[38],"improve":[40],"this":[41],"to":[42],"0(E":[43],"log":[44,45,47],"V+V":[46],"V).":[48],"Here":[49],"V":[50],"and":[51,58,80],"E":[52],"are":[53],"the":[54],"number":[55],"of":[56],"vertices":[57],"edges.":[59],"The":[60],"algorithm":[61],"uses":[62,73],"exchanges":[64],"ordered":[65],"efficiently":[66],"on":[67],"reduced":[69],"graph;":[70],"it":[71],"also":[72],"efficient":[74],"algorithms":[75],"for":[76],"minimum":[77],"trees":[79],"priority":[81],"queues.":[82]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}