Maximin Center of Pendant Vertices in a Tree Network

The problem is to find a point in a tree whose distance to the closest pendant vertex is maximum. This paper presents a polynomial-time algorithm which reduces the given tree successively until such a point is found.