On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs (Q1016039): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-007-9124-y
@@ Property / DOI: 10.1007/s10878-007-9124-y / rank @@
-Normal rank
@@ 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.1007/s10878-007-9124-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2038841453
@@ Property / OpenAlex ID: W2038841453 / rank @@
+Normal rank
@@ Property / cites work @@
+On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-007-9124-Y
@@ Property / DOI: 10.1007/S10878-007-9124-Y / rank @@
+Normal rank