An estimator for matching size in low arboricity graphs with two applications (Q2106871): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3109520868 / 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: Structural results on matching estimation with applications to streaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Streaming: Maximal Matching and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating matching size from random streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Approximate Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Matching in Streams Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5240429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling with a reservoir / rank
 
Normal rank

Latest revision as of 23:11, 30 July 2024

scientific article
Language Label Description Also known as
English
An estimator for matching size in low arboricity graphs with two applications
scientific article

    Statements

    An estimator for matching size in low arboricity graphs with two applications (English)
    0 references
    0 references
    29 November 2022
    0 references
    maximum matching
    0 references
    approximation algorithms
    0 references
    data stream algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references