On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605): Difference between revisions

@@ Property / cites work @@
+On the outer-connected domination in graphs
@@ Property / cites work: On the outer-connected domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Approximation hardness of dominating set problems in bounded degree graphs
+Normal rank
@@ Property / cites work @@
+Q5442365
@@ Property / cites work: Q5442365 / rank @@
+Normal rank
@@ Property / cites work @@
+Total outer-connected domination in trees
@@ Property / cites work: Total outer-connected domination in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Total outer-connected domination numbers of trees
@@ Property / cites work: Total outer-connected domination numbers of trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the total outer-connected domination in graphs
@@ Property / cites work: On the total outer-connected domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3059038
@@ Property / cites work: Q3059038 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a minimum outer-connected dominating set for the class of chordal graphs
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Non-approximability results for optimization problems on bounded degree instances
+Normal rank