首页|Capture times in the bridge-burning cops and robbers game
Capture times in the bridge-burning cops and robbers game
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
In this paper, we consider a variant of the cops and robbers game on a graph, introduced by Kinnersley and Peterson, in which every time the robber uses an edge, it is removed from the graph, known as bridge-burning cops and robbers. In particular, we study the maximum time it takes the cops to capture the robber. (C) 2022 Elsevier B.V. All rights reserved.
Cops and robbersGraph gamesCapture timeBridge-burningRandom graph
Herrman, Rebekah、van Hintum, Peter、Smith, Stephen G. Z.
NSTL
Elsevier
