A note on watchman's walks in de Bruijn graphs
Reviewed by Pithpith:DYHKB7AWopen to challenge →
classification
math.CO
keywords
bruijnwalkwatchmangraphsorderarcscallscertain
read the original abstract
The watchman's walk problem in a digraph calls for finding a minimum length closed dominating walk, where direction of arcs is respected. The watchman's walk of a de Bruijn graph of order $k$ is described by a de Bruijn sequence of order $k-1$. This idea is extended to certain subdigraphs of de Bruijn graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.