The following publications are possibly variants of this publication:
- Node-to-Set Disjoint Paths Problem in Cross-CubesRikuya Sasaki, Hiroyuki Ichida, Htoo Htoo Sandi Kyaw, Keiichi Kaneko. ieicetd, 107(1):53-59, January 2024. [doi]
- Node-to-Node Disjoint Paths Problem in Möbius CubesDavid Kocik, Keiichi Kaneko. ieicet, 100-D(8):1837-1843, 2017. [doi]
- Node-to-Set Disjoint Paths Routing in Dual-CubeKeiichi Kaneko, Shietung Peng. ispan 2008: 77-82 [doi]
- Node-to-Set Disjoint Paths Problem in a Möbius CubeDavid Kocik, Yuki Hirai, Keiichi Kaneko. ieicet, 99-D(3):708-713, 2016. [doi]
- Node-disjoint Paths in a Transposition GraphYasuto Suzuki, Keiichi Kaneko, Mario Nakamori. pdpta 2004: 298-304