A Linear Time Algorithm for Finding a k-Tree Core

Akiyoshi Shioura, Takeaki Uno

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)


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 languageEnglish
Pages (from-to)281-290
Number of pages10
JournalJournal of Algorithms
Issue number2
Publication statusPublished - 1997 May

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Computational Theory and Mathematics


Dive into the research topics of 'A Linear Time Algorithm for Finding a k-Tree Core'. Together they form a unique fingerprint.

Cite this