Power assignment for \(k\)-connectivity in wireless ad hoc networks (Q1781807): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-005-6858-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2129893614
@@ Property / OpenAlex ID: W2129893614 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
+Normal rank
@@ Property / cites work @@
+Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for minimum-cost k-vertex connected subgraphs
+Normal rank
@@ Property / cites work @@
+A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
+Normal rank
@@ Property / cites work @@
+An application of submodular flows
@@ Property / cites work: An application of submodular flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140422
@@ Property / cites work: Q3140422 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753740
@@ Property / cites work: Q2753740 / rank @@
+Normal rank
@@ Property / cites work @@
+On \(k\)-con-critically \(n\)-connected graphs
@@ Property / cites work: On \(k\)-con-critically \(n\)-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Three tree-paths
@@ Property / cites work: Three tree-paths / rank @@
+Normal rank