On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-023-01024-7
+Normal rank
@@ Property / OpenAlex ID @@
+W4365518251
@@ Property / OpenAlex ID: W4365518251 / rank @@
+Normal rank
@@ Property / cites work @@
+Roman \(\{2 \}\)-domination
@@ Property / cites work: Roman \(\{2 \}\)-domination / rank @@
+Normal rank
@@ Property / cites work @@
+APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
+Normal rank
@@ Property / cites work @@
+Italian domination in trees
@@ Property / cites work: Italian domination in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5243996
@@ Property / cites work: Q5243996 / rank @@
+Normal rank
@@ Property / cites work @@
+Roman \(\{2\}\)-bondage number of a graph
@@ Property / cites work: Roman \(\{2\}\)-bondage number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Roman domination in subgraphs of grids
@@ Property / cites work: Roman domination in subgraphs of grids / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Roman {2}-domination and the double Roman domination in graphs
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete MAXSAT problem
@@ Property / cites work: A simplified NP-complete MAXSAT problem / rank @@
+Normal rank
@@ Property / cites work @@
+Universality considerations in VLSI circuits
@@ Property / cites work: Universality considerations in VLSI circuits / rank @@
+Normal rank