In this paper, we propose two efficient parallel algorithms for constructing a
-tree center and a
-tree core of a tree network, respectively. Both algorithms take
) time using
) work on the EREW PRAM. Our algorithms improve the algorithms previously proposed by Wang (IEEE Trans. Par. Dist. Sys. 1998) and Peng et al. (J. Algorithms 1993).