{"id":"https://openalex.org/W3046915141","doi":"https://doi.org/10.1145/3409915.3409925","title":"A Unified Proof for Finding a Minimal Spanning Tree","display_name":"A Unified Proof for Finding a Minimal Spanning Tree","publication_year":2020,"publication_date":"2020-06-21","ids":{"openalex":"https://openalex.org/W3046915141","doi":"https://doi.org/10.1145/3409915.3409925","mag":"3046915141"},"language":"en","primary_location":{"id":"doi:10.1145/3409915.3409925","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3409915.3409925","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 3rd International Conference on Mathematics and Statistics","raw_type":"proceedings-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/A5053319187","display_name":"Ray-Ming Chen","orcid":"https://orcid.org/0000-0003-4551-2563"},"institutions":[{"id":"https://openalex.org/I4210141223","display_name":"Baise University","ror":"https://ror.org/03f3rne76","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210141223"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ray-Ming Chen","raw_affiliation_strings":["Baise University, Baise, Guangxi, China"],"affiliations":[{"raw_affiliation_string":"Baise University, Baise, Guangxi, China","institution_ids":["https://openalex.org/I4210141223"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053319187"],"corresponding_institution_ids":["https://openalex.org/I4210141223"],"apc_list":null,"apc_paid":null,"fwci":0.1542,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51381382,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"34","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9958000183105469,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9958000183105469,"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.9944999814033508,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8496944904327393},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8469762802124023},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5952310562133789},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5902160406112671},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5810688734054565},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5582950115203857},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5096557140350342},{"id":"https://openalex.org/keywords/proof-of-concept","display_name":"Proof of concept","score":0.43786340951919556},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.431916207075119},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40971797704696655},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34304702281951904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3014441728591919},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2500694990158081}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8496944904327393},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8469762802124023},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5952310562133789},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5902160406112671},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5810688734054565},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5582950115203857},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5096557140350342},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.43786340951919556},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.431916207075119},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40971797704696655},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34304702281951904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3014441728591919},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2500694990158081},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3409915.3409925","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3409915.3409925","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 3rd International Conference on Mathematics and Statistics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1128809682","https://openalex.org/W2017927472","https://openalex.org/W2091058432","https://openalex.org/W2171813245","https://openalex.org/W2898099437","https://openalex.org/W2912549256","https://openalex.org/W4236109534"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2376814941","https://openalex.org/W2387385213","https://openalex.org/W2390742649","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W2562218965","https://openalex.org/W2138987445","https://openalex.org/W620960161"],"abstract_inverted_index":{"Finding":[0],"a":[1,8,20,23,30,44,57],"minimal":[2],"spanning":[3],"tree":[4],"(MST)":[5],"has":[6],"attracted":[7],"lot":[9],"of":[10,22,40,59,68],"researchers.":[11],"There":[12],"are":[13],"many":[14],"approaches":[15],"and":[16,55],"ways":[17],"to":[18,42,50],"find":[19,56],"MST":[21,58],"network.":[24],"In":[25],"this":[26],"article,":[27],"we":[28],"demonstrate":[29],"systematic":[31],"approach":[32,48],"based":[33,64],"on":[34,65],"natural":[35],"induction":[36,67],"over":[37],"the":[38,52,66],"set":[39],"nodes":[41],"reach":[43],"final":[45],"MST.":[46],"The":[47],"is":[49],"label":[51],"given":[53],"network":[54],"it":[60],"by":[61],"growing":[62],"trees":[63],"labelled":[69],"nodes.":[70]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}