The complexity of flood-filling games on graphs (Q423894): Difference between revisions

@@ Property / author @@
-Q326808
@@ Property / author: Q326808 / rank @@
-Normal rank
@@ Property / author @@
-Alexander D. Scott
@@ Property / author: Alexander D. Scott / rank @@
-Normal rank
@@ Property / author @@
+Alexander D. Scott
@@ Property / author: Alexander D. Scott / rank @@
+Normal rank
@@ 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.1016/j.dam.2011.09.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2031883007
@@ Property / OpenAlex ID: W2031883007 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of flood filling games
@@ Property / cites work: The complexity of flood filling games / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic analysis of the Honey-Bee game
@@ Property / cites work: An algorithmic analysis of the Honey-Bee game / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of free-flood-it on \(2\times n\) boards
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank