講座題目：Zero-Visibility Cops-and-Robber Problems on Graphs 2017-06-26 講座題目：Zero-Visibility Cops-and-Robber Problems on Graphs報(bào)告人：Boting Yang 教授，University of Regina時(shí)間：2017.6.29 15:00-17:00地點(diǎn)：bwin必贏唯一官網(wǎng)202Title: Zero-Visibility Cops-and-Robber Problems onGraphs基于圖論的警察小偷博弈模型Abstract: In this talk, we consider the zero-visibilitycops and robber game. We show that the zero-visibility cop-number of a graph isbounded above by its pathwidth and cannot be bounded below by any nontrivialfunction of the pathwidth. As well, we define a monotonic version of this gameand show that the monotonic zero-visibility cop-number can be bounded bothabove and below by positive multiples of the pathwidth.歡迎廣大師生參與！管理科學(xué)系2017.6.26