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

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

Latest revision as of 01:44, 21 July 2024

scientific article; zbMATH DE number 7135845
Language Label Description Also known as
English
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection
scientific article; zbMATH DE number 7135845

    Statements

    Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2019
    0 references
    sublinear time algorithms
    0 references
    degeneracy
    0 references
    degree distribution
    0 references
    approximation algorithms
    0 references
    arboricity
    0 references
    degree moments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references