寻找最小生成树的一个统一证明

Proceedings of the 2020 3rd International Conference on Mathematics and Statistics Pub Date : 2020-06-21 DOI:10.1145/3409915.3409925

Ray-Ming Chen

{"title":"寻找最小生成树的一个统一证明","authors":"Ray-Ming Chen","doi":"10.1145/3409915.3409925","DOIUrl":null,"url":null,"abstract":"Finding a minimal spanning tree (MST) has attracted a lot of researchers. There are many approaches and ways to find a MST of a network. In this article, we demonstrate a systematic approach based on natural induction over the set of nodes to reach a final MST. The approach is to label the given network and find a MST of it by growing trees based on the induction of labelled nodes.","PeriodicalId":114746,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Mathematics and Statistics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Unified Proof for Finding a Minimal Spanning Tree\",\"authors\":\"Ray-Ming Chen\",\"doi\":\"10.1145/3409915.3409925\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finding a minimal spanning tree (MST) has attracted a lot of researchers. There are many approaches and ways to find a MST of a network. In this article, we demonstrate a systematic approach based on natural induction over the set of nodes to reach a final MST. The approach is to label the given network and find a MST of it by growing trees based on the induction of labelled nodes.\",\"PeriodicalId\":114746,\"journal\":{\"name\":\"Proceedings of the 2020 3rd International Conference on Mathematics and Statistics\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 3rd International Conference on Mathematics and Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3409915.3409925\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Mathematics and Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3409915.3409925","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

寻找最小生成树(MST)吸引了许多研究者。寻找网络的MST有很多方法和方法。在本文中，我们演示了一种基于节点集的自然归纳的系统方法，以达到最终的MST。该方法是对给定的网络进行标记，并通过基于标记节点的归纳生长树来找到它的MST。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Unified Proof for Finding a Minimal Spanning Tree

Finding a minimal spanning tree (MST) has attracted a lot of researchers. There are many approaches and ways to find a MST of a network. In this article, we demonstrate a systematic approach based on natural induction over the set of nodes to reach a final MST. The approach is to label the given network and find a MST of it by growing trees based on the induction of labelled nodes.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 2020 3rd International Conference on Mathematics and Statistics

自引率

0.00%

发文量