A partition approach to lower bounds for zero-visibility cops and robber

DOI10.1007/978-3-030-25005-8_36OpenAlexW2959463218MaRDI QIDQ2301762

Yuan Xue, Farong Zhong, Boting Yang, Sandra Zilles

Publication date: 25 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25005-8_36

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (4)

A simple method for proving lower bounds in the zero-visibility cops and robber game ⋮ One-visibility cops and robber on trees ⋮ Computing the one-visibility copnumber of trees ⋮ One-visibility cops and robber on trees: optimal cop-win strategies

This page was built for publication: A partition approach to lower bounds for zero-visibility cops and robber