On the hardness of optimization in power-law graphs (Q2481967): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.12.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2008138618
@@ Property / OpenAlex ID: W2008138618 / rank @@
+Normal rank
@@ 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 @@
+The diameter of a scale-free random graph
@@ Property / cites work: The diameter of a scale-free random graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3287781
@@ Property / cites work: Q3287781 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank