{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
