| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Guarding a subgraph as a tool in pursuit-evasion games
Authors:ID Bokal, Drago (Author)
ID Jerebic, Janja (Author)
Files:URL https://sciendo.com/article/10.7151/dmgt.2244
 
.pdf Guarding_a_Subgraph_as_a_Tool_in_Pu-Bokal-2022.pdf (377,93 KB)
MD5: 11963C3EA41A404EDFA1E31318385747
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
Abstract: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.
Keywords:pursuit-evasion game, graph searching, guarding, shadow function, graph retraction
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2022
Year of publishing:2021
Number of pages:str. 123-138
Numbering:Vol. 42, no. 1
PID:20.500.12556/DKUM-85071 New window
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:8147219 New window
Publication date in DKUM:17.08.2023
Views:555
Downloads:68
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discussiones mathematicae. Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.

Secondary language

Language:Slovenian
Keywords:igra izogibanja zasledovanju, preiskovanje grafov, straženje v grafih, funkcija sence, grafovski retrakti


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica