确定最小生成树的矩阵法

International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences Pub Date : 2020-06-28 DOI:10.37082/ijirmps.2020.v08i03.005

Farhan Banu

{"title":"确定最小生成树的矩阵法","authors":"Farhan Banu","doi":"10.37082/ijirmps.2020.v08i03.005","DOIUrl":null,"url":null,"abstract":"This paper is concerned with Minimum Spanning Tree problem, a fundamental problem of Network modeling. Here we have proposed a novel approach to determine minimum spanning tree of an undirected connected network which is also demonstrated with numerical example.","PeriodicalId":246139,"journal":{"name":"International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Matrix Method for Determining Minimum Spanning Tree\",\"authors\":\"Farhan Banu\",\"doi\":\"10.37082/ijirmps.2020.v08i03.005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is concerned with Minimum Spanning Tree problem, a fundamental problem of Network modeling. Here we have proposed a novel approach to determine minimum spanning tree of an undirected connected network which is also demonstrated with numerical example.\",\"PeriodicalId\":246139,\"journal\":{\"name\":\"International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37082/ijirmps.2020.v08i03.005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37082/ijirmps.2020.v08i03.005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了网络建模的一个基本问题——最小生成树问题。本文提出了一种确定无向连通网络最小生成树的新方法，并通过数值算例进行了验证。

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

查看原文本刊更多论文

Matrix Method for Determining Minimum Spanning Tree

This paper is concerned with Minimum Spanning Tree problem, a fundamental problem of Network modeling. Here we have proposed a novel approach to determine minimum spanning tree of an undirected connected network which is also demonstrated with numerical example.

求助全文

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

来源期刊

International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences

自引率

0.00%

发文量