Complexity issues of variants of secure domination in graphs (Q2413340): 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.1016/j.endm.2017.11.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2774310888
@@ Property / OpenAlex ID: W2774310888 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4653767
@@ Property / cites work: Q4653767 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5461685
@@ Property / cites work: Q5461685 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+On secure domination in graphs
@@ Property / cites work: On secure domination in graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2413340