Showing papers on "K-tree published in 1992"
28 May 1992
TL;DR: The authors define a generalization of a core which they call a k-tree core, a subtree T' of T containing exactly k leaves that minimizes d(T')= Sigma /sub up silon in V(T)/d( upsilon, T'), where d( upSilon , T') is the distance from vertex upsilons to subtreeT'.
Abstract: The authors define a generalization of a core which they call a k-tree core. Given a tree T and parameter k, a k-tree core is a subtree T' of T containing exactly k leaves that minimizes d(T')= Sigma /sub upsilon in V(T)/d( upsilon , T'), where d( upsilon , T') is the distance from vertex upsilon to subtree T'. They then give two algorithms to find a k-tree core of a tree with n vertices. The complexities of these algorithms are O(kn) and O(n lg n) respectively. This work is motivated by a resource allocation problem dealing with a partially replicated distributed database defined on a tree network. >
1 citations