Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 281-290 |
| Number of pages | 10 |
| Journal | Journal of Algorithms |
| Volume | 23 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1997 May |
ASJC Scopus subject areas
- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics
Fingerprint Dive into the research topics of 'A Linear Time Algorithm for Finding a k-Tree Core'. Together they form a unique fingerprint.
Cite this
Shioura, A., & Uno, T. (1997). A Linear Time Algorithm for Finding a k-Tree Core. Journal of Algorithms, 23(2), 281-290. https://doi.org/10.1006/jagm.1996.0838