License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2020.37
URN: urn:nbn:de:0030-drops-131151
URL: https://drops.dagstuhl.de/opus/volltexte/2020/13115/
Go to the corresponding LIPIcs Volume Portal


Ahmadi, Mohamad ; Kuhn, Fabian

Distributed Maximum Matching Verification in CONGEST

pdf-format:
LIPIcs-DISC-2020-37.pdf (0.6 MB)


Abstract

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 in synchronous rounds. More specifically, we consider the distributed CONGEST model, where in each round, each node of G can send an O(log n)-bit message to each of its neighbors. We show that for every graph G and a matching M of G, there is a randomized CONGEST algorithm to verify M being a maximum matching of G in time O(|M|) and disprove it in time O(D + š“), where D is the diameter of G and š“ is the length of a shortest augmenting path. We hope that our algorithm constitutes a significant step towards developing a CONGEST algorithm to compute a maximum matching in time OĢƒ(s^*), where s^* is the size of a maximum matching.

BibTeX - Entry

@InProceedings{ahmadi_et_al:LIPIcs:2020:13115,
  author =	{Mohamad Ahmadi and Fabian Kuhn},
  title =	{{Distributed Maximum Matching Verification in CONGEST}},
  booktitle =	{34th International Symposium on Distributed Computing (DISC 2020)},
  pages =	{37:1--37:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-168-9},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{179},
  editor =	{Hagit Attiya},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/13115},
  URN =		{urn:nbn:de:0030-drops-131151},
  doi =		{10.4230/LIPIcs.DISC.2020.37},
  annote =	{Keywords: distributed matching, distributed graph algorithms, augmenting paths}
}

Keywords: distributed matching, distributed graph algorithms, augmenting paths
Collection: 34th International Symposium on Distributed Computing (DISC 2020)
Issue Date: 2020
Date of publication: 07.10.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI