Given a tree containing n vertices, consider the sum of the distance between all vertices and a k-leaf subtree (subtree which contains exactly k leaves). A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-tree core for a given k.
ASJC Scopus subject areas
- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics