Distributed maximal matching

DOI10.1145/2332432.2332464zbMath1301.68204arXiv1110.0367OpenAlexW4301085782MaRDI QIDQ2933793

Juho Hirvonen, Jukka Suomela

Publication date: 5 December 2014

Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.0367

zbMATH Keywords

lower boundsdistributed algorithmsmaximal matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Improved deterministic distributed matching via rounding ⋮ Linear-in-\(\varDelta \) lower bounds in the LOCAL model ⋮ Deterministic local algorithms, unique identifiers, and fractional graph colouring ⋮ Distributed half-integral matching and beyond ⋮ Distributed half-integral matching and beyond

This page was built for publication: Distributed maximal matching