Distance domination and amplifier placement problems

Simple item page
dc.contributor.authorTaylor, S
dc.contributor.authorWanless, Ian
dc.contributor.authorBoland, N L
dc.date.accessioned2015-12-08T22:20:31Z
dc.date.issued2006
dc.date.updated2015-12-08T08:31:14Z
dc.description.abstractWe 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
dc.identifier.issn1034-4942
dc.identifier.urihttp://hdl.handle.net/1885/32035
dc.publisherUniversity of Queensland
dc.sourceAustralasian Journal of Combinatorics
dc.titleDistance domination and amplifier placement problems
dc.typeJournal article
local.bibliographicCitation.lastpage136
local.bibliographicCitation.startpage117
local.contributor.affiliationTaylor, S, University of Melbourne
local.contributor.affiliationWanless, Ian, College of Engineering and Computer Science, ANU
local.contributor.affiliationBoland, N L, University of Melbourne
local.contributor.authoremailu3488323@anu.edu.au
local.contributor.authoruidWanless, Ian, u3488323
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor010104 - Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)
local.identifier.absseo970101 - Expanding Knowledge in the Mathematical Sciences
local.identifier.ariespublicationu4251866xPUB88
local.identifier.citationvolume34
local.identifier.scopusID2-s2.0-84885724301
local.identifier.uidSubmittedByu4251866
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Taylor_Distance_domination_and_2006.pdf
Size:
1.47 MB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2024 LYRASIS