Distance domination and amplifier placement problems
Date
2006
Authors
Taylor, S
Wanless, Ian
Boland, N L
Journal Title
Journal ISSN
Volume Title
Publisher
University of Queensland
Abstract
We consider the optimisation problem defined on a connected undirected graph with given root vertex and a parameter s, in which we seek a spanning tree with the smallest number of special (amplifying) vertices such that each vertex in the tree is preceded
Description
Keywords
Citation
Collections
Source
Australasian Journal of Combinatorics
Type
Journal article
Book Title
Entity type
Access Statement
License Rights
DOI
Restricted until
2037-12-31
Downloads
File
Description