| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Naslov: Guarding a subgraph as a tool in pursuit-evasion games ID Bokal, Drago (Avtor)ID Jerebic, Janja (Avtor) https://sciendo.com/article/10.7151/dmgt.2244  Guarding_a_Subgraph_as_a_Tool_in_Pu-Bokal-2022.pdf (377,93 KB)MD5: 11963C3EA41A404EDFA1E31318385747 Angleški jezik Znanstveno delo 1.01 - Izvirni znanstveni članek FNM - Fakulteta za naravoslovje in matematikoFOV - Fakulteta za organizacijske vede 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. pursuit-evasion game, graph searching, guarding, shadow function, graph retraction Objavljeno Objavljena publikacija 01.01.2022 2021 str. 123-138 Vol. 42, no. 1 20.500.12556/DKUM-85071 519.17 8147219 1234-3099 17.08.2023 259 16 Ostalo Kopiraj citat

Skupna ocena: (0 glasov) Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.

Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Naslov: Discussiones mathematicae. Graph theory Discuss. Math., Graph Theory Technical University Press 1234-3099 7487065

## Licence

Licenca: CC BY-NC-ND 4.0, Creative Commons Priznanje avtorstva-Nekomercialno-Brez predelav 4.0 Mednarodna http://creativecommons.org/licenses/by-nc-nd/4.0/deed.sl Najbolj omejujoča licenca Creative Commons. Uporabniki lahko prenesejo in delijo delo v nekomercialne namene in ga ne smejo uporabiti za nobene druge namene.

## Sekundarni jezik

Jezik: Slovenski jezik igra izogibanja zasledovanju, preiskovanje grafov, straženje v grafih, funkcija sence, grafovski retrakti

## Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
 0 - 0 / 0 Ni komentarjev!

Nazaj