Title :
Efficient algorithms for locating a core of a tree network with a specified length
Author :
Peng, Shietung ; Lo, Win-tsung
Author_Institution :
Dept. of Comput. Sci., Maryland Univ., Baltimore, MD, USA
Abstract :
The authors present efficient algorithms for finding a core of tree with a specified length for both sequential and parallel computational models. The algorithms can be readily extended to a tree network in which arcs have nonnegative integer lengths. The authors also present a parallel version of the algorithm on an EREW PRAM (parallel random access machine) model. The results presented might provide a basis for the study of other facility shapes such as trees and forests of fixed sizes
Keywords :
parallel algorithms; random-access storage; EREW PRAM; algorithms; facility shapes; forests; parallel computational models; parallel version; sequential computational models; tree network; Computer networks; Computer science; Concurrent computing; Joining processes; Minimax techniques; Parallel algorithms; Phase change random access memory; Piecewise linear techniques; Tellurium; Tree graphs;
Conference_Titel :
Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
Conference_Location :
McLean, VA
Print_ISBN :
0-8186-2772-7
DOI :
10.1109/FMPC.1992.234904
