Santosh Kumar, Elias Munapo, Philimon Nyamugure, Trust Tawanda
{"title":"Minimum Spanning Tree Approach to Path Through K Specified Links","authors":"Santosh Kumar, Elias Munapo, Philimon Nyamugure, Trust Tawanda","doi":"10.13052/jgeu0975-1416.1127","DOIUrl":null,"url":null,"abstract":"This paper presents a minimum spanning tree approach to find a path through ‘k’ specified links. This problem has many real-life applications and unlike the shortest route, the path through specified links may have loops. The proposed method determines the route, which may either be an optimal or a near optimal path. It may also contain loops.","PeriodicalId":489098,"journal":{"name":"Journal of Graphic Era University","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graphic Era University","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13052/jgeu0975-1416.1127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper presents a minimum spanning tree approach to find a path through ‘k’ specified links. This problem has many real-life applications and unlike the shortest route, the path through specified links may have loops. The proposed method determines the route, which may either be an optimal or a near optimal path. It may also contain loops.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
