An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters.
Qian-Ping GuShietung PengPublished in: Comput. J. (1996)
Keyphrases
- tree structure
- graph structure
- optimal path
- learning algorithm
- detection algorithm
- computationally efficient
- genetic algorithm
- input data
- worst case
- search space
- clustering algorithm
- np hard
- dynamic programming
- computational complexity
- objective function
- hierarchical clustering
- neural network
- preprocessing
- particle swarm optimization
- optimal solution
- similarity measure
- initial set
- road segments
- root node
- routing decisions