The complexity of secure domination problem in graphs (Q1708386): 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.7151/dmgt.2008
@@ Property / full work available at URL: https://doi.org/10.7151/dmgt.2008 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2738841429
@@ Property / OpenAlex ID: W2738841429 / 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 @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating sets for split and bipartite graphs
@@ Property / cites work: Dominating sets for split and bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dually Chordal Graphs
@@ Property / cites work: Dually Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Covers and Secure Domination in Graphs
@@ Property / cites work: Vertex Covers and Secure Domination in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for secure domination in trees
@@ Property / cites work: A linear algorithm for secure domination in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5173719
@@ Property / cites work: Q5173719 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation hardness of dominating set problems in bounded degree graphs
+Normal rank
@@ Property / cites work @@
+Irredundance, secure domination and maximum degree in trees
+Normal rank
@@ Property / cites work @@
+Q5461685
@@ Property / cites work: Q5461685 / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Secure domination critical graphs
@@ Property / cites work: Secure domination critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4552196
@@ Property / cites work: Q4552196 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+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 @@
+Secure domination and secure total domination in graphs
+Normal rank
@@ Property / cites work @@
+On secure domination in graphs
@@ Property / cites work: On secure domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5461705
@@ Property / cites work: Q5461705 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank