CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
On the computational complexity of a game of cops and robbers
Authors
Marcello Mamino
Publication date
18 December 2012
Publisher
'Elsevier BV'
Doi
Cite
View
on
arXiv
Abstract
We study the computational complexity of a perfect-information two-player game proposed by Aigner and Fromme (1984) [1]. The game takes place on an undirected graph where n simultaneously moving cops attempt to capture a single robber, all moving at the same speed. The players are allowed to pick their starting positions at the first move. The question of the computational complexity of deciding this game was raised by Goldstein and Reingold (1995) [9]. We prove that the game is hard for PSPACE.©2012 Elsevier B.V. All rights reserved
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Archivio della Ricerca - Università di Pisa
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arpi.unipi.it:11568/912575
Last time updated on 01/04/2018