About event:

Imagine you are assigned to guard an art gallery. At the end of the day, you need to make rounds through all the rooms. How can this be done most efficiently if you are allowed both to enter the rooms and simply peek through the doors?
In the talk “The Watchman's Walk Problem on Graphs and Digraphs,” we will explore the well-known graph domination problem—the watchman walk problem. Special attention will be given to directed graphs and the presenters' own research findings.