Search results for: MOBBER

• Hobbes Studies

  Journals

  ISSN: 0921-5891 , eISSN: 1875-0257

• Rubber World

  Journals

  ISSN: 0035-9572

• The Complexity of Zero-Visibility Cops and Robber

  Publication

  • D. Dereniowski
  • D. Dyer
  • R. M. Tifenbach
  • B. Yang

  - Year 2014

  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.

  Full text to download in external service

• The complexity of zero-visibility cops and robber

  Publication

  • D. Dereniowski
  • D. Dyer
  • R. M. Tifenbach
  • B. Yang

  - THEORETICAL COMPUTER SCIENCE - Year 2015

  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...

  Full text available to download

• RUBBER CHEMISTRY AND TECHNOLOGY

  Journals

  ISSN: 0035-9475 , eISSN: 1943-4804

• PLASTICS RUBBER AND COMPOSITES

  Journals

  ISSN: 1465-8011 , eISSN: 1743-2898

• Journal of Mother and Child

  Journals

  ISSN: 2719-535X

• Journal of Rubber Research

  Journals

  ISSN: 1511-1768

• Zero-Visibility Cops and Robber Game on a Graph

  Publication

  • D. Dereniowski
  • D. Dyer
  • R. M. Tifenbach
  • B. Yang

  - LECTURE NOTES IN COMPUTER SCIENCE - Year 2013

  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.

  Full text to download in external service

• Zero-visibility cops and robber and the pathwidth of a graph

  Publication

  • D. Dereniowski
  • D. Dyer
  • R. M. Tifenbach
  • B. Yang

  - JOURNAL OF COMBINATORIAL OPTIMIZATION - Year 2015

  We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...

  Full text to download in external service