Computing the one-visibility cop-win strategies for trees (Q2149861): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-92681-6_11
+Normal rank
@@ Property / OpenAlex ID @@
+W4205947909
@@ Property / OpenAlex ID: W4205947909 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3090934
@@ Property / cites work: Q3090934 / rank @@
+Normal rank
@@ Property / cites work @@
+Limited visibility cops and robber
@@ Property / cites work: Limited visibility cops and robber / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of searching a graph
@@ Property / cites work: The complexity of searching a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-to-vertex pursuit in a graph
@@ Property / cites work: Vertex-to-vertex pursuit in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4724424
@@ Property / cites work: Q4724424 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple method for proving lower bounds in the zero-visibility cops and robber game
+Normal rank
@@ Property / cites work @@
+One-visibility cops and robber on trees
@@ Property / cites work: One-visibility cops and robber on trees / rank @@
+Normal rank