|
Volumn , Issue , 1997, Pages 16-19
|
Efficient parallel algorithms for optimally locating a k-leaf tree in a tree network
a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
COMPUTER NETWORKS;
DATA STRUCTURES;
RANDOM ACCESS STORAGE;
TREES (MATHEMATICS);
TREE NETWORKS;
PARALLEL ALGORITHMS;
|
EID: 0030654419
PISSN: 01903918
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (2)
|
References (8)
|