冒泡排序图中的节点到节点内部不相交路径问题

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI:10.1109/PRDC.2004.1276568

K. Kaneko, Yasuto Suzuki

{"title":"冒泡排序图中的节点到节点内部不相交路径问题","authors":"K. Kaneko, Yasuto Suzuki","doi":"10.1109/PRDC.2004.1276568","DOIUrl":null,"url":null,"abstract":"A bubble-sort graph is a variant of Cayley graphs and it is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, we focus on nth bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between arbitrary two nodes in the complexity of polynomial order of n which is the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of path lengths after proving the correctness of the algorithm. Moreover, we report the results of computer experiment to evaluate average performance of the algorithm.","PeriodicalId":383639,"journal":{"name":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Node-to-node internally disjoint paths problem in bubble-sort graphs\",\"authors\":\"K. Kaneko, Yasuto Suzuki\",\"doi\":\"10.1109/PRDC.2004.1276568\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A bubble-sort graph is a variant of Cayley graphs and it is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, we focus on nth bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between arbitrary two nodes in the complexity of polynomial order of n which is the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of path lengths after proving the correctness of the algorithm. Moreover, we report the results of computer experiment to evaluate average performance of the algorithm.\",\"PeriodicalId\":383639,\"journal\":{\"name\":\"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PRDC.2004.1276568\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2004.1276568","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

摘要

气泡排序图是Cayley图的一种变体，由于其结构简单、规则，适合作为大规模并行系统的拓扑结构。因此，我们以第n个冒泡排序图为研究对象，提出了一种求任意两个节点间n-1条不相交路径的算法，其复杂度为多项式阶n，即图的阶数加1。在证明了算法的正确性后，估计了算法的时间复杂度和路径长度之和。此外，我们还报告了计算机实验结果，以评估算法的平均性能。

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

查看原文本刊更多论文

Node-to-node internally disjoint paths problem in bubble-sort graphs

A bubble-sort graph is a variant of Cayley graphs and it is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, we focus on nth bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between arbitrary two nodes in the complexity of polynomial order of n which is the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of path lengths after proving the correctness of the algorithm. Moreover, we report the results of computer experiment to evaluate average performance of the algorithm.

求助全文

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

来源期刊

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.

自引率

0.00%

发文量