{"id":"https://openalex.org/W2095963760","doi":null,"title":"The minimum degree spanning tree problem on directed acyclic graphs","display_name":"The minimum degree spanning tree problem on directed acyclic graphs","publication_year":2006,"publication_date":"2006-12-16","ids":{"openalex":"https://openalex.org/W2095963760","mag":"2095963760"},"language":"en","primary_location":{"id":"mag:2095963760","doi":null,"is_oa":false,"landing_page_url":"http://www.wseas.us/e-library/conferences/2006tenerife/papers/541-298.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5082593524","display_name":"Yao Guohui","orcid":"https://orcid.org/0009-0009-4576-5895","observed_orcids":["https://orcid.org/0009-0009-4576-5895"]},"institutions":[{"id":"https://openalex.org/I154099455","display_name":"Shandong University","ror":"https://ror.org/0207yh398","country_code":"CN","type":"education","lineage":["https://openalex.org/I154099455"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yao Guohui","raw_affiliation_strings":["School of Computer Science and Technology, Shandong University, Ji'nan, P.R. China"],"raw_orcid":"https://orcid.org/0009-0009-4576-5895","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Shandong University, Ji'nan, P.R. China","institution_ids":["https://openalex.org/I154099455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101769221","display_name":"Daming Zhu","orcid":"https://orcid.org/0000-0001-9395-7247","observed_orcids":["https://orcid.org/0000-0001-9395-7247","https://orcid.org/0000-0001-5450-2071"]},"institutions":[{"id":"https://openalex.org/I154099455","display_name":"Shandong University","ror":"https://ror.org/0207yh398","country_code":"CN","type":"education","lineage":["https://openalex.org/I154099455"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Daming Zhu","raw_affiliation_strings":["School of Computer Science and Technology, Shandong University, Ji'nan, P.R. China"],"raw_orcid":"https://orcid.org/0000-0001-9395-7247","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Shandong University, Ji'nan, P.R. China","institution_ids":["https://openalex.org/I154099455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110187676","display_name":"Shaohan Ma","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I154099455","display_name":"Shandong University","ror":"https://ror.org/0207yh398","country_code":"CN","type":"education","lineage":["https://openalex.org/I154099455"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shaohan Ma","raw_affiliation_strings":["School of Computer Science and Technology, Shandong University, Ji'nan, P.R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Shandong University, Ji'nan, P.R. China","institution_ids":["https://openalex.org/I154099455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154099455"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"311","last_page":"316"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":9.999999747378752e-05,"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.0,"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-graphs","display_name":"directed acyclic graphs","score":0.9919999837875366},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.9279999732971191},{"id":"https://openalex.org/keywords/spanning-tree-optimization","display_name":"spanning tree optimization","score":0.593999981880188}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7471627593040466},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7134534120559692},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6637647151947021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6508595943450928},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6255627870559692},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6124774217605591},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5370368957519531},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.48948752880096436},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4879309833049774},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.47567692399024963},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45234739780426025},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.43295520544052124},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4044238328933716},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3411485552787781},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.16208946704864502},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13297906517982483},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2095963760","doi":null,"is_oa":false,"landing_page_url":"http://www.wseas.us/e-library/conferences/2006tenerife/papers/541-298.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1547559421","https://openalex.org/W1590881797","https://openalex.org/W1600533941","https://openalex.org/W1918603512","https://openalex.org/W2002764437","https://openalex.org/W2017127755","https://openalex.org/W2063807274","https://openalex.org/W2066700938","https://openalex.org/W2074417667","https://openalex.org/W2110559866","https://openalex.org/W2125690626","https://openalex.org/W2803888831"],"related_works":["https://openalex.org/W2070543274","https://openalex.org/W7095070866","https://openalex.org/W3005696157","https://openalex.org/W7164018607","https://openalex.org/W2738162363","https://openalex.org/W2323992346","https://openalex.org/W2381418104","https://openalex.org/W2944918303","https://openalex.org/W2122848400","https://openalex.org/W2352525723"],"abstract_inverted_index":{"The":[0,30,71],"minimum":[1,21],"degree":[2,22,60],"spanning":[3,23,36],"tree":[4,24],"problem":[5,25],"has":[6],"been":[7],"studied":[8],"extensively.":[9],"In":[10],"this":[11],"paper,":[12],"we":[13],"present":[14],"a":[15,55],"polynomial":[16],"time":[17],"algorithm":[18,31,52,72],"for":[19,61],"the":[20,41,51,58,82],"on":[26],"directed":[27],"acyclic":[28],"graphs.":[29],"starts":[32],"with":[33],"an":[34,68],"arbitrary":[35],"tree,":[37],"and":[38,64,79,86],"iteratively":[39],"reduces":[40],"number":[42,83],"of":[43,45,57,84],"vertices":[44,87],"maximum":[46,59],"degree.":[47],"We":[48],"can":[49],"prove":[50],"must":[53],"reduce":[54],"vertex":[56],"each":[62],"phase,":[63],"finally":[65],"result":[66],"in":[67,74],"optimal":[69],"tree.":[70],"terminates":[73],"O(mnlogn)":[75],"time,":[76],"where":[77],"m":[78],"n":[80],"are":[81],"edges":[85],"respectively.":[88]},"counts_by_year":[],"updated_date":"2026-09-24T07:57:37.273135","created_date":"2016-06-24T00:00:00"}