{"title":"Vertex-disjoint routings in star graphs","authors":"Chi-Chang Chen, Jianer Chen","doi":"10.1109/ICAPP.1995.472218","DOIUrl":null,"url":null,"abstract":"We show the necessary and sufficient condition for any two nodes in an n-dimensional star graph to have n-1 vertex-disjoint paths with length less than or equal to the minimum distance plus 2. We also provide an algorithm to generate these n-1 vertex-disjoint paths.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
We show the necessary and sufficient condition for any two nodes in an n-dimensional star graph to have n-1 vertex-disjoint paths with length less than or equal to the minimum distance plus 2. We also provide an algorithm to generate these n-1 vertex-disjoint paths.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
