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

Broadcasts and domination in trees

โœ Scribed by E.J. Cockayne; S. Herke; C.M. Mynhardt

Book ID
108114207
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
328 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Restrained domination in trees
Restrained domination in trees
โœ Gayla S. Domke; Johannes H. Hattingh; Michael A. Henning; Lisa R. Markus ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 91 KB
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

k-Broadcasting in trees
k-Broadcasting in trees
โœ Hovhannes A. Harutyunyan; Arthur L. Liestman ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 147 KB
Nonadaptive broadcasting in trees
Nonadaptive broadcasting in trees
โœ Hovhannes A. Harutyunyan; Arthur L. Liestman; Kazuhisa Makino; Thomas C. Shermer ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 210 KB

We study nonadaptive broadcasting in trees, a process of sending a message from one vertex in a tree to all other vertices. In the nonadaptive model, each vertex has a specified, ordered list of its neighbors. After receiving a broadcast message, a vertex sends the message to its neighbors, one afte