Node-to-Set Disjoint Paths Problem in a Möbius Cube-Reference-Cited by-同舟云学术

Node-to-Set Disjoint Paths Problem in a Möbius Cube

Published:2016 Issue:3 Volume:E99.D Page:708-713
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

KOCIK David¹,HIRAI Yuki²,KANEKO Keiichi²

Affiliation:

1. Faculty of Information Technology, Czech Technical University in Prague

2. Institute of Engineering, Tokyo University of Agriculture and Technology

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

https://www.jstage.jst.go.jp/article/transinf/E99.D/3/E99.D_2015EDP7331/_pdf

Reference25 articles.

1. [1] S. Abraham and K. Padmanabhan, “An analysis of the twisted cube topology,” Proceedings of the International Conference on Parallel Processing, pp.116-120, Pennsylvania State Press, Aug. 1989.

2. [2] Academic Computer Center Cyfronet AGH, “Prometheus and Zeus both on TOP500.” http://www.cyfronet.krakow.pl/en/15366,artykul,p.html

3. [3] A. Bossard, “A set-to-set disjoint paths routing algorithm in hyper-star graphs,” ISCA International Journal of Computers and Their Applications, vol.21, no.1, pp.76-82, March 2014.

4. [4] A. Bossard and K. Kaneko, “The set-to-set disjoint-path problem in perfect hierarchical hypercubes,” The Computer Journal, vol.55, no.6, pp.769-775, June 2012.

5. [5] A. Bossard and K. Kaneko, “Time optimal node-to-set disjoint paths routing in hypercubes,” Journal of Information Science and Engineering, vol.30, no.4, pp.1087-1093, July 2014.

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

1. Node-to-Set Disjoint Paths Problem in Cross-Cubes;IEICE Transactions on Information and Systems;2024-01-01

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

3. Set-to-Set Disjoint Paths Problem in Möbius Cubes;IEEE Access;2022

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

5. Node-to-set disjoint paths problem in cross-cubes;The Journal of Supercomputing;2021-06-09