http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Yaroslav Shitov (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
Two remarks on the game of Cops and Robbers
Yaroslav Shitov 대한수학회 2020 대한수학회보 Vol.57 No.1
We discuss two unrelated topics regarding \textit{Cops and Robbers}, a well-known pursuit-evasion game played on a simple graph. First, we address a recent question of Breen et al.~and prove the PSPACE-completeness of the \textit{cop throttling number}, that is, the minimal possible sum of the number $k$ of cops and the number $\operatorname{capt}(k)$ of moves that the robber can survive against $k$ cops under the optimal play of both sides. Secondly, we revisit a \textit{teleporting} version of the game due to Wagner; we disprove one of his conjectures and suggest a new related research problem.
-
TWO REMARKS ON THE GAME OF COPS AND ROBBERS
Shitov, Yaroslav Korean Mathematical Society 2020 대한수학회보 Vol.57 No.1
We discuss two unrelated topics regarding Cops and Robbers, a well-known pursuit-evasion game played on a simple graph. First, we address a recent question of Breen et al. and prove the PSPACE-completeness of the cop throttling number, that is, the minimal possible sum of the number k of cops and the number capt(k) of moves that the robber can survive against k cops under the optimal play of both sides. Secondly, we revisit a teleporting version of the game due to Wagner; we disprove one of his conjectures and suggest a new related research problem.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
