论文标题
关于守望者漫步的注释
A note on watchman's walks in de Bruijn graphs
论文作者
论文摘要
Digraph中守望者的步行问题要求找到最小长度的封闭式行走，其中尊重弧线的方向。 de Bruijn订单$ k $的守望者步行图是由de Bruijn订单$ k-1 $描述的。这个想法扩展到了de bruijn图的某些子图。
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.
