A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs
نویسندگان
چکیده
We present a simple single-pass data stream algorithm using O( −2 logn) space that returns a (α+ 2)(1 + ) approximation to the size of the maximum matching in a graph of arboricity α. 1998 ACM Subject Classification F.2 Analysis of Algorithms & Problem Complexity
منابع مشابه
Planar Matching in Streams Revisited
We present data stream algorithms for estimating the size or weight of the maximum matching in low arboricity graphs. A large body of work has focused on improving the constant approximation factor for general graphs when the data stream algorithm is permitted O(n polylogn) space where n is the number of nodes. This space is necessary if the algorithm must return the matching. Recently, Esfandi...
متن کاملA Note on Logarithmic Space Stream Algorithms for Matchings in Low Arboricity Graphs
We present a data stream algorithm for estimating the size of the maximum matching of a low arboricity graph. Recall that a graph has arboricity α if its edges can be partitioned into at most α forests and that a planar graph has arboricity α = 3. Estimating the size of the maximum matching in such graphs has been a focus of recent data stream research [1–3,5, 7]. See also [6] for a survey of t...
متن کاملEstimating Weighted Matchings in o(n) Space
We consider the problem of estimating the weight of a maximum weighted matching of a weighted graph G(V, E) whose edges are revealed in a streaming fashion. We develop a reduction from the maximum weighted matching problem to the maximum cardinality matching problem that only doubles the approximation factor of a streaming algorithm developed for the maximum cardinality matching problem. Our re...
متن کاملThe Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs
Estimating the size of the maximum matching is a canonical problem in graph algorithms, and one that has attracted extensive study over a range of different computational models. We present improved streaming algorithms for approximating the size of maximum matching with sparse (bounded arboricity) graphs. • (Insert-Only Streams) We present a one-pass algorithm that takes O(c log n) space and a...
متن کاملSublinear Estimation of Weighted Matchings in Dynamic Data Streams
This paper presents an algorithm for estimating the weight of a maximum weighted matching by augmenting any estimation routine for the size of an unweighted matching. The algorithm is implementable in any streaming model including dynamic graph streams. We also give the first constant estimation for the maximum matching size in a dynamic graph stream for planar graphs (or any graph with bounded...
متن کامل