Distributed approximation for f-matching

Abstract

Let $G=(V,E)$ be a graph and let $f:V\to Z^{+}$. An f-matching in G is a set of edges $F\subseteq E$ such that every vertex $v\in V$ is incident to at most $f\left(v\right)$ edges. In this paper we will give a constant-time distributed algorithm which approximates a maximum f-matching in bi-colored graphs of constant arboricity.