Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-023-00989-9
+Normal rank
@@ Property / OpenAlex ID @@
+W4318767821
@@ Property / OpenAlex ID: W4318767821 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+A polylogarithmic approximation algorithm for 2-edge-connected dominating set
+Normal rank
@@ Property / cites work @@
+On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
+Normal rank
@@ Property / cites work @@
+Connected dominating set. Theory and applications
@@ Property / cites work: Connected dominating set. Theory and applications / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
+Normal rank
@@ Property / cites work @@
+On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
+Normal rank
@@ Property / cites work @@
+A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
+Normal rank
@@ Property / cites work @@
+On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
+Normal rank
@@ Property / cites work @@
+Optimal Coverage in Wireless Sensor Networks
@@ Property / cites work: Optimal Coverage in Wireless Sensor Networks / rank @@
+Normal rank
@@ Property / cites work @@
+TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
+Normal rank
@@ Property / cites work @@
+Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs
+Normal rank
@@ Property / cites work @@
+A greedy algorithm for the fault-tolerant connected dominating set in a general graph
+Normal rank