A linear-time algorithm for broadcast domination in a tree

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) to every vertex v in a graph such...

Full description

Bibliographic Details

Published in:	Networks Vol. 53; no. 2; pp. 160 - 169
Main Authors:	Dabney, John, Dean, Brian C., Hedetniemi, Stephen T.
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.03.2009
Subjects:	broadcasts domination linear-time algorithms tree algorithms
ISSN:	0028-3045, 1097-0037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!