Routing-efficient CDS construction in disk-containment graphs (Q2448125): Difference between revisions

@@ Property / DOI @@
-.1007/s11590-012-0590-5
@@ Property / DOI: 10.1007/s11590-012-0590-5 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228484
@@ Property / cites work: Q4228484 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+Distributed dynamic channel access scheduling for ad hoc networks.
+Normal rank
@@ Property / cites work @@
+On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
+Normal rank
@@ Property / cites work @@
+Minimum connected dominating sets and maximal independent sets in unit disk graphs
+Normal rank
@@ Property / cites work @@
+On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
+Normal rank
@@ Property / DOI @@
+.1007/S11590-012-0590-5
@@ Property / DOI: 10.1007/S11590-012-0590-5 / rank @@
+Normal rank