Algorithmic aspects of 2-secure domination in graphs (Q2045038): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-021-00739-9
@@ Property / DOI: 10.1007/s10878-021-00739-9 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-021-00739-9
+Normal rank
@@ Property / OpenAlex ID @@
+W3155641883
@@ Property / OpenAlex ID: W3155641883 / 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 @@
+The algorithmic use of hypertree structure and maximum neighbourhood orderings
+Normal rank
@@ Property / cites work @@
+Approximation hardness of dominating set problems in bounded degree graphs
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of semitotal domination in graphs
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of secure connected domination in graphs
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Some Variants of Domination in Graphs
+Normal rank
@@ Property / cites work @@
+Two Hardness Results on Feedback Vertex Sets
@@ Property / cites work: Two Hardness Results on Feedback Vertex Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
+Normal rank
@@ Property / cites work @@
+Complexity issues of variants of secure domination in graphs
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Doubly chordal graphs, steiner trees, and connected domination
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-021-00739-9
@@ Property / DOI: 10.1007/S10878-021-00739-9 / rank @@
+Normal rank