In this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.
Authors
- prof. dr hab. inż. Dariusz Dereniowski link open in new tab ,
- Danny Dyer,
- Ryan M. Tifenbach,
- Boting Yang
Additional information
- DOI
- Digital Object Identifier link open in new tab 10.1007/978-3-319-08016-1_6
- Category
- Aktywność konferencyjna
- Type
- materiały konferencyjne indeksowane w Web of Science
- Language
- angielski
- Publication year
- 2014
Source: MOSTWiedzy.pl - publication "The Complexity of Zero-Visibility Cops and Robber" link open in new tab
