A time-constrained variation of the watchman's walk problem

zbMATH Open1256.05167MaRDI QIDQ2906847FDOQ2906847

Danny Dyer, Rebecca Milley

Publication date: 5 September 2012

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

domination numberdominating setwatchman'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)

Cited In (5)

• The watchman's walk problem on directed graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds on watching and watching graph products
• Even time constraints on the watchman's walk

   Recommendations

• Even time constraints on the watchman's walk 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The watchman's walk problem on directed graphs 👍 👎
• Bounds on watching and watching graph products 👍 👎

This page was built for publication: A time-constrained variation of the watchman's walk problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906847)