Algorithmic results in secure total dominating sets on graphs (Q2136269): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2022.03.016
+Normal rank
@@ Property / OpenAlex ID @@
+W4221042980
@@ Property / OpenAlex ID: W4221042980 / rank @@
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5503336
@@ Property / cites work: Q5503336 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation hardness of dominating set problems in bounded degree graphs
+Normal rank
@@ Property / cites work @@
+Q5461685
@@ Property / cites work: Q5461685 / rank @@
+Normal rank
@@ Property / cites work @@
+Secure total domination in graphs: bounds and complexity
+Normal rank
@@ Property / cites work @@
+Q3097062
@@ Property / cites work: Q3097062 / rank @@
+Normal rank
@@ Property / cites work @@
+Secure total domination in chain graphs and cographs
+Normal rank
@@ Property / cites work @@
+The complexity of domination problems in circle graphs
+Normal rank
@@ Property / cites work @@
+Secure domination and secure total domination in graphs
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+The complexity of secure domination problem in graphs
+Normal rank