scientific article

zbMath1256.05167MaRDI QIDQ2906847

Danny Dyer, Rebecca Milley

Publication date: 5 September 2012

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p097.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dominating setdomination numberwatchman's walk problemclosed dominating walk of minimal lengthfixed time constraintsmultiple guards

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

The watchman's walk problem on directed graphs ⋮ Bounds on watching and watching graph products

This page was built for publication: