An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes.
Qian-Ping GuShietung PengPublished in: ICPADS (1996)
Keyphrases
- small number
- initial set
- learning algorithm
- dynamic programming
- preprocessing
- input pattern
- decomposition algorithm
- worst case
- convex hull
- detection algorithm
- polynomial time complexity
- graph structure
- convergence rate
- random variables
- optimization algorithm
- linear programming
- state space
- probability distribution
- computational cost
- wireless sensor networks
- evolutionary algorithm