星图中顶点不相交的路由

Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI:10.1109/ICAPP.1995.472218

Chi-Chang Chen, Jianer Chen

{"title":"星图中顶点不相交的路由","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":"{\"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}","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

摘要

给出了n维星图中任意两个节点具有n-1条顶点不相交路径且路径长度小于或等于最小距离加2的充要条件。我们还提供了一种算法来生成这些n-1顶点不相交的路径。

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

查看原文本刊更多论文

Vertex-disjoint routings in star graphs

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.<>

求助全文

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

来源期刊

Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing

自引率

0.00%

发文量