Dynamic Approximate Maximum Matching in the Distributed Vertex Partition Model

Peter Robinson, Xianbin Zhu

We initiate the study of approximate maximum matching in the vertex partition model, for graphs subject to dynamic changes. We assume that the $n$ vertices of the graph are partiti…