4 besides being efficient on the erew pram in the sequential case our algorithm for finding a k tree core of a tree network improves the two algorithms previously proposed in 10