Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs
نویسندگان
چکیده
We give a deterministic distributed approximation algorithm for the maximum matching problem in graphs of bounded arboricity. Specifically, given 0 < 2 < 1 and a positive integer a, the algorithm finds a matching of size at least (1 − 2)m(G), where m(G) is the size of the maximum matching in an n-vertex graph G with arboricity at most a. The algorithm runs in O(log∗ n) rounds in the message passing model and it is the first sublogarithmic algorithm for the problem on such a wide class of graphs. Moreover, the result implies that the known Ω( p log n/ log log n) lower bound on the time complexity for a constant or polylogarithmic approximation does not hold for graphs of bounded arboricity.
منابع مشابه
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation algorithms on restricted graph classes. In this paper, we compromise between generality and efficiency by considering the problem on graphs of small arboricity a. These family includes, but is not limited to, graphs excluding ...
متن کامل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...
متن کامل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...
متن کاملLocal Algorithms for Bounded Degree Sparsifiers in Sparse Graphs
In graph sparsification, the goal has almost always been of global nature: compress a graph into a smaller subgraph (sparsifier) that maintains certain features of the original graph. Algorithms can then run on the sparsifier, which in many cases leads to improvements in the overall runtime and memory. This paper studies sparsifiers that have bounded (maximum) degree, and are thus locally spars...
متن کاملStreaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
We consider the problem of estimating the size of a maximum matching when the edges are revealed in a streaming fashion. Consider a graph G = (V,E) with n vertices and m edges. The input stream is a permutation of edges S = 〈e1, . . . , em〉 chosen by an adversary. The goal is to output an estimation of the size of a maximum matching. The algorithm is only allowed to use a small amount of memory...
متن کامل