Computing the one-visibility cop-win strategies for trees

DOI10.1007/978-3-030-92681-6_11OpenAlexW4205947909MaRDI QIDQ2149861

Boting Yang

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_11

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

The one-visibility localization game

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex-to-vertex pursuit in a graph
• A simple method for proving lower bounds in the zero-visibility cops and robber game
• Limited visibility cops and robber
• One-visibility cops and robber on trees
• The complexity of searching a graph

This page was built for publication: Computing the one-visibility cop-win strategies for trees