Login / Signup
Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes.
Antoine Bossard
Keiichi Kaneko
Published in:
J. Inf. Sci. Eng. (2014)
Keyphrases
</>
disjoint paths
directed graph
undirected graph
optimal solution
computational complexity