Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes

Antoine Bossard, Keiichi Kaneko. Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. J. Inf. Sci. Eng., 30(4):1087-1093, 2014. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.