Zero-Visibility Cops and Robber Game on a Graph

Dariusz Dereniowski; Danny Dyer; Ryan M. Tifenbach; Boting Yang

doi:10.1007/978-3-642-38756-2_19

Zero-Visibility Cops and Robber Game on a Graph

Abstract

We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops & robber game in one way: the robber is invisible. We show that this model is not monotonic. We also provide bounds on both the zero-visibility copnumber and monotonic zero-visibility copnumber in terms of the pathwidth.

Citations

2

CrossRef
0

Web of Science
4

Scopus

Authors (4)

Dariusz Dereniowski prof. dr hab. inż.
Danny Dyer
- Memorial University of Newfoundland Department of Mathematics and Statistics
Ryan M. Tifenbach
- Memorial University of Newfoundland Department of Mathematics and Statistics
Boting Yang
- University of Regina Department of Computer Science

Cite as

Full text

full text is not available in portal

full content of the article see on external site open in new tab

Keywords

Details

Category:: Articles
Type:: artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
Published in:: LECTURE NOTES IN COMPUTER SCIENCE no. 7924, pages 175 - 186,
ISSN: 0302-9743
Language:: English
Publication year:: 2013
Bibliographic description:: Dereniowski D., Dyer D., Tifenbach R., Yang B.: Zero-Visibility Cops and Robber Game on a Graph// LECTURE NOTES IN COMPUTER SCIENCE. -Vol. 7924., (2013), s.175-186
DOI:: Digital Object Identifier (open in new tab) 10.1007/978-3-642-38756-2_19
Verified by:: Gdańsk University of Technology