About: Complexity of the cop and robber guarding game

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Complexity of the cop and robber guarding game Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://dx.doi.org/10.1007/978-3-642-25011-8_29
Description	The guarding game is a game in which several cops has to guard a region in a (directed or undirected) graph against a robber. The robber and the cops are placed on vertices of the graph; they take turns in moving to adjacent vertices (or staying), cops inside the guarded region, the robber on the remaining vertices (the robber-region). The goal of the robber is to enter the guarded region at a vertex with no cop on it. The problem is to determine whether for a given graph and given number of cops the cops are able to prevent the robber from entering the guarded region. The problem is highly nontrivial even for very simple graphs. It is known that when the robber-region is a tree, the problem is NP-complete, and if the robber-region is a directed acyclic graph, the problem becomes PSPACE-complete [Fomin, Golovach, Hall, Mihalák, Vicari, Widmayer: How to Guard a Graph? Algorithmica, DOI: 10.1007/s00453-009-9382-4]. We solve the question asked by Fomin et al. in the previously mentioned paper and we show that if the graph is arbitrary (directed or undirected), the problem becomes E-complete. The guarding game is a game in which several cops has to guard a region in a (directed or undirected) graph against a robber. The robber and the cops are placed on vertices of the graph; they take turns in moving to adjacent vertices (or staying), cops inside the guarded region, the robber on the remaining vertices (the robber-region). The goal of the robber is to enter the guarded region at a vertex with no cop on it. The problem is to determine whether for a given graph and given number of cops the cops are able to prevent the robber from entering the guarded region. The problem is highly nontrivial even for very simple graphs. It is known that when the robber-region is a tree, the problem is NP-complete, and if the robber-region is a directed acyclic graph, the problem becomes PSPACE-complete [Fomin, Golovach, Hall, Mihalák, Vicari, Widmayer: How to Guard a Graph? Algorithmica, DOI: 10.1007/s00453-009-9382-4]. We solve the question asked by Fomin et al. in the previously mentioned paper and we show that if the graph is arbitrary (directed or undirected), the problem becomes E-complete. (en)
Title	Complexity of the cop and robber guarding game Complexity of the cop and robber guarding game (en)
skos:prefLabel	Complexity of the cop and robber guarding game Complexity of the cop and robber guarding game (en)
skos:notation	RIV/00216208:11320/11:10101028!RIV12-GA0-11320___
http://linked.open...avai/predkladatel	Matematicko-fyzikální fakulta
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(1M0545), P(GPP201/10/P337), S, Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Valla, Tomáš Stolař, Rudolf Šámal, Robert
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	191413
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/11:10101028
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	game; guarding; robber; cop; Complexity (en)
http://linked.open.../riv/klicoveSlovo	Complexity cop game guarding robber
http://linked.open...odStatuVydavatele	DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV	[8DEC33536A7E]
http://linked.open...i/riv/nazevZdroje	Lecture Notes in Computer Science
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute for Theoretical Computer Science Flows and cycles in graphs using mappings between graphs
http://linked.open...UplatneniVysledku	2011
http://linked.open...v/svazekPeriodika	7056
http://linked.open...iv/tvurceVysledku	Stolař, Rudolf Valla, Tomáš Šámal, Robert
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
issn	0302-9743
number of pages	13 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-25011-8_29
http://localhost/t...ganizacniJednotka	11320
is http://linked.open...avai/riv/vysledek of	Complexity of the cop and robber guarding game Complexity of the cop and robber guarding game

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software