Repozytorium publikacji - Politechnika Gdańska

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.

Autorzy

• prof. dr hab. inż. Dariusz Dereniowski link otwiera się w nowej karcie ,
• Danny Dyer,
• Ryan M. Tifenbach,
• Boting Yang