Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants

DOI10.1145/3382734.3405745OpenAlexW3046783344MaRDI QIDQ5855209

Dennis Olivetti, Sebastian F. Brandt

Publication date: 15 March 2021

Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

lower boundsmaximal matchingLOCAL model

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast ⋮ Distributed Lower Bounds for Ruling Sets ⋮ Linial for lists

This page was built for publication: Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants