Inapproximability of dominating set on power law graphs (Q476891): Difference between revisions

@@ Property / cites work @@
+A random graph model for massive graphs
@@ Property / cites work: A random graph model for massive graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Random Graph Model for Power Law Graphs
@@ Property / cites work: A Random Graph Model for Power Law Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Popularity based random graph models leading to a scale-free degree sequence
+Normal rank
@@ Property / cites work @@
+Q5501331
@@ Property / cites work: Q5501331 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+On the hardness of optimization in power-law graphs
+Normal rank
@@ Property / cites work @@
+Approximability of the vertex cover problem in power-law graphs
+Normal rank
@@ Property / cites work @@
+Renormalization group analysis of the small-world network model
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+New techniques for approximating optimal substructure problems in power-law graphs
+Normal rank