The following publications are possibly variants of this publication:
- Node-to-set disjoint-path routing in perfect hierarchical hypercubesAntoine Bossard, Keiichi Kaneko, Shietung Peng. procedia, 4:442-451, 2011. [doi]
- The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical HypercubesAntoine Bossard, Keiichi Kaneko. cj, 55(6):769-775, 2012. [doi]
- A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical HypercubesAntoine Bossard, Keiichi Kaneko, Shietung Peng. cj, 54(8):1372-1381, 2011. [doi]
- Fault-Tolerant Node-to-Set Disjoint-Path Routing in HypercubesAntoine Bossard, Keiichi Kaneko, Shietung Peng. ica3pp 2010: 511-519 [doi]
- k-pairwise disjoint paths routing in perfect hierarchical hypercubesAntoine Bossard, Keiichi Kaneko. tjs, 67(2):485-495, 2014. [doi]
- Set-to-Set Disjoint Paths Routing in Dual-CubesKeiichi Kaneko, Shietung Peng. pdcat 2008: 129-136 [doi]
- A Node-to-Set Disjoint-Path Routing Algorithm in MetacubeAntoine Bossard, Keiichi Kaneko, Shietung Peng. ispan 2009: 23-28 [doi]