Node-to-node Disjoint Paths in Twisted Crossed Cubes-Reference-Cited by-同舟云学术

Node-to-node Disjoint Paths in Twisted Crossed Cubes

Published:2018 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 10th International Conference on Advances in Information Technology - IAIT 2018
language:
Short-container-title:

Author:

Nagashima Hiroki¹,Mouri Kousuke¹,Kaneko Keiichi¹

Affiliation:

1. Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo

Publisher

ACM Press

Reference23 articles.

1. Antoine Bossard. 2014. A set-to-set disjoint paths routing algorithm in hyper-star graphs. ISCA International Journal of Computers and Their Applications 21, 1 (March 2014), 76--82.

2. Antoine Bossard and Keiichi Kaneko. 2012. Node-to-Set Disjoint-path Routing in Hierarchical Cubic Networks. Comput. J. 55, 12 (Dec. 2012), 1440--1446.

3. Antoine Bossard and Keiichi Kaneko. 2012. The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes. Comput. J. 55, 6 (June 2012), 769--775.

4. Antoine Bossard and Keiichi Kaneko. 2014. Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks. Comput. J. 57, 2 (Feb. 2014), 332--337.

5. Antoine Bossard and Keiichi Kaneko. 2014. Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. Journal of Information Science and Engineering 30, 4 (July 2014), 1087--1093.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Node-to-Node and Node-to-Set Disjoint Paths Problems in Bicubes;IEICE Transactions on Information and Systems;2024-09-01

2. Minimal Paths in a Bicube;IEICE Transactions on Information and Systems;2022-08-01

3. Set-to-Set Disjoint Path Routing in Bijective Connection Graphs;IEEE Access;2022

4. A Shortest-Path Routing Algorithm in Bicubes;Advances in Parallel & Distributed Processing, and Applications;2021

5. Node-Disjoint Paths Problems in Directed Bijective Connection Graphs;IEICE Transactions on Information and Systems;2020-01-01