Guarding a subgraph as a tool in pursuit-evasion gamesDrago Bokal
, Janja Jerebic
, 2021, izvirni znanstveni članek
Opis: Pursuit-evasion games study the number of cops needed to capture therobber in a game played on a graph, in which the cops and the robber movealternatively to neighbouring vertices, and the robber is captured if a copsteps on the vertex the robber is in. A common tool in analyzing this copnumber of a graph is a cop moving along a shortest path in a graph, thuspreventing the robber to step onto this path. We generalize this approach byintroducing a shadow of the robber, the maximal set of vertices from whichthe cop parries the protected subgraph. In this context, the robber becomesan intruder and the cop becomes the guard. We show that the shadow canbe computed in polynomial time, implying polynomial time algorithms forcomputing both a successful guard as well as a successful intruder, whicheverexists. Furthermore, we show that shadow function generalizes the conceptof graph retractions. In some cases, this implies a polynomially computablecertification of the negative answer to the NP-complete problem of existenceof a retraction to a given subgraph.
Ključne besede: pursuit-evasion game, graph searching, guarding, shadow function, graph retraction
Objavljeno v DKUM: 17.08.2023; Ogledov: 257; Prenosov: 16
Celotno besedilo (377,93 KB)
Gradivo ima več datotek! Več...