An efficient construction of one-to-many node-disjoint paths in folded hypercubes.

Published in: J. Parallel Distributed Comput. (2014)

Keyphrases

disjoint paths
directed graph
approximation algorithms
undirected graph
graph structure
data structure
construction process
database
databases
real world
data streams
active learning
special case
probabilistic model
tree structure