Two conditions for reducing the maximal length of node-disjoint paths in hypercubes.

Published in: Theor. Comput. Sci. (2012)

Keyphrases

disjoint paths
directed graph
approximation algorithms
undirected graph
minimal length
sufficient conditions
optimal solution
data structure
cooperative
gray level
total length