|
Volumn 39, Issue 1, 1996, Pages 14-19
|
Efficient algorithm for node-to-node routing in hypercubes with faulty clusters
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
DATA STRUCTURES;
FAULT TOLERANT COMPUTER SYSTEMS;
GRAPH THEORY;
INTERCONNECTION NETWORKS;
PARALLEL PROCESSING SYSTEMS;
CLUSTER FAULT TOLERANT ROUTING;
FAULTY CLUSTER;
HYPERCUBES;
NODE TO NODE ROUTING;
DATA COMMUNICATION SYSTEMS;
|
EID: 0029717902
PISSN: 00104620
EISSN: None
Source Type: Journal
DOI: 10.1093/comjnl/39.1.14 Document Type: Article |
Times cited : (13)
|
References (15)
|