Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298): Difference between revisions

@@ Property / cites work @@
+Sublinear-time algorithms for counting star subgraphs via edge sampling
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
+Normal rank
@@ Property / cites work @@
+The space complexity of approximating the frequency moments
+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 @@
+Why do simple algorithms for triangle enumeration work in the real world?
+Normal rank
@@ Property / cites work @@
+The method of moments and degree distributions for network models
+Normal rank
@@ Property / cites work @@
+Algorithmic Complexity of Power Law Networks
@@ Property / cites work: Algorithmic Complexity of Power Law Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum Spanning Tree Weight in Sublinear Time
+Normal rank
@@ Property / cites work @@
+Arboricity and Subgraph Listing Algorithms
@@ Property / cites work: Arboricity and Subgraph Listing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Power-Law Distributions in Empirical Data
@@ Property / cites work: Power-Law Distributions in Empirical Data / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
+Normal rank
@@ Property / cites work @@
+Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximately Counting Triangles in Sublinear Time
+Normal rank
@@ Property / cites work @@
+Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection
+Normal rank
@@ Property / cites work @@
+Q5009503
@@ Property / cites work: Q5009503 / rank @@
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
+Normal rank
@@ Property / cites work @@
+Relaxing the uniformity and independence assumptions using the concept of fractal dimension
+Normal rank
@@ Property / cites work @@
+On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
+Normal rank
@@ Property / cites work @@
+Approximating average parameters of graphs
@@ Property / cites work: Approximating average parameters of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Stars and Other Small Subgraphs in Sublinear-Time
+Normal rank
@@ Property / cites work @@
+Local Graph Partitions for Approximation and Testing
+Normal rank
@@ Property / cites work @@
+Approximating the distance to properties in bounded-degree and general sparse graphs
+Normal rank
@@ Property / cites work @@
+Smallest-last ordering and clustering and graph coloring algorithms
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Structural sparsity
@@ Property / cites work: Structural sparsity / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743463
@@ Property / cites work: Q5743463 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
+Normal rank
@@ Property / cites work @@
+Winners don't take all: Characterizing the competition for links on the web
+Normal rank
@@ Property / cites work @@
+An improved constant-time approximation algorithm for maximum~matchings
+Normal rank