Distributed Maximum Matching Verification in CONGEST

Mohamad Ahmadi, Fabian Kuhn

We study the maximum cardinality matching problem in a standard distributed setting, where the nodes $V$ of a given $n$-node network graph $G=(V,E)$ communicate over the edges $E$…