About: The guarding game is E-complete

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

About: The guarding game is E-complete 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
Description	The guarding game is a game in which several cops try to guard a region in a (directed or undirected) graph against Robber. Robber and the cops are placed on the vertices of the graph; they take turns in moving to adjacent vertices (or staying), cops inside the guarded region, Robber on the remaining vertices (the robber-region). The goal of 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 Robber from entering the guarded region. Fomin et al. (2011) [7] proved that the problem is NP-complete when the robber-region is restricted to a tree. Further they prove that is it PSPACE-complete when the robber-region is restricted to a directed acyclic graph, and they ask about the problem complexity for arbitrary graphs. In this paper we prove that the problem is E-complete for arbitrary directed graphs. The guarding game is a game in which several cops try to guard a region in a (directed or undirected) graph against Robber. Robber and the cops are placed on the vertices of the graph; they take turns in moving to adjacent vertices (or staying), cops inside the guarded region, Robber on the remaining vertices (the robber-region). The goal of 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 Robber from entering the guarded region. Fomin et al. (2011) [7] proved that the problem is NP-complete when the robber-region is restricted to a tree. Further they prove that is it PSPACE-complete when the robber-region is restricted to a directed acyclic graph, and they ask about the problem complexity for arbitrary graphs. In this paper we prove that the problem is E-complete for arbitrary directed graphs. (en)
Title	The guarding game is E-complete The guarding game is E-complete (en)
skos:prefLabel	The guarding game is E-complete The guarding game is E-complete (en)
skos:notation	RIV/68407700:21240/14:00214334!RIV15-MSM-21240___
http://linked.open...avai/riv/aktivita	I P S
http://linked.open...avai/riv/aktivity	I, P(GBP202/12/G061), P(LL1201), S
http://linked.open...iv/cisloPeriodika	0
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Valla, Tomáš
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	České vysoké učení technické v Praze / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	18672
http://linked.open...ai/riv/idVysledku	RIV/68407700:21240/14:00214334
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Cops-and-Robber game; E-completeness; Graph guarding game; Propositional formulas; Pursuit game (en)
http://linked.open.../riv/klicoveSlovo	Cops-and-Robber game E-completeness Graph guarding game Propositional formulas Pursuit game
http://linked.open...odStatuVydavatele	GB - Spojené království Velké Británie a Severního Irska
http://linked.open...ontrolniKodProRIV	[5773BD76B14A]
http://linked.open...i/riv/nazevZdroje	Theoretical Computer Science
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Center of excellence - Institute for theoretical computer science (CE-ITI) Complex Structures: Regularities in Combinatorics and Discrete Mathematics
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	521
http://linked.open...iv/tvurceVysledku	Valla, Tomáš Šámal, R.
http://linked.open...ain/vavai/riv/wos	000331433100008
issn	0304-3975
number of pages	15 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.tcs.2013.11.034
http://localhost/t...ganizacniJednotka	21240

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