The complexity of zero-visibility cops and robber - Publication - Bridge of Knowledge

Search

The complexity of zero-visibility cops and robber

Abstract

We consider the zero-visibility cops & robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial class of graphs.

Citations

  • 1 7

    CrossRef

  • 0

    Web of Science

  • 1 7

    Scopus

Authors (4)

Cite as

Full text

download paper
downloaded 32 times
Publication version
Accepted or Published Version
DOI:
Digital Object Identifier (open in new tab) 10.1016/j.tcs.2015.03.022
License
Copyright (2015 Elsevier B.V.)

Keywords

Details

Category:
Articles
Type:
artykuł w czasopiśmie wyróżnionym w JCR
Published in:
THEORETICAL COMPUTER SCIENCE no. 607, pages 135 - 148,
ISSN: 0304-3975
Language:
English
Publication year:
2015
Bibliographic description:
Dereniowski D., Dyer D., Tifenbach R., Yang B.: The complexity of zero-visibility cops and robber// THEORETICAL COMPUTER SCIENCE. -Vol. 607, nr. part 2 (2015), s.135-148
DOI:
Digital Object Identifier (open in new tab) 10.1016/j.tcs.2015.03.022
Verified by:
Gdańsk University of Technology

seen 150 times

Recommended for you

Meta Tags