๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A linear algorithm for finding the k-broadcast center of a tree

โœ Scribed by Hovhannes A. Harutyunyan; Arthur L. Liestman; Bin Shao

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
114 KB
Volume
53
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A linear-time algorithm for broadcast do
A linear-time algorithm for broadcast domination in a tree
โœ John Dabney; Brian C. Dean; Stephen T. Hedetniemi ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 268 KB

## Abstract The broadcast domination problem is a variant of the classical minimum dominating set problem in which a transmitter of power __p__ at vertex __v__ is capable of dominating (broadcasting to) all vertices within distance __p__ from __v__. Our goal is to assign a broadcast power __f__(__v

A Linear Time Algorithm for Finding ak-T
A Linear Time Algorithm for Finding ak-Tree Core
โœ Akiyoshi Shioura; Takeaki Uno ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 173 KB

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-t