Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants
METADATA ONLY
Loading...
Author / Producer
Date
2020-07
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
In a recent breakthrough result, Balliu et al. [FOCS'19] proved a deterministic Ω(min(Δ, log n/ log log n))-round and a randomized Ω(min(Δ, log log n/ log log log n))-round lower bound for the complexity of the bipartite maximal matching problem on n-node graphs in the LOCAL model of distributed computing. Both lower bounds are asymptotically tight as a function of the maximum degree Δ.
We provide truly tight bounds in Δ for the complexity of bipartite maximal matching and many natural variants, up to and including the additive constant. As a by-product, our results yield a considerably simplified version of the proof by Balliu et al.
We show that our results can be obtained via bounded automatic round elimination, a version of the recent automatic round elimination technique by Brandt [PODC'19] that is particularly suited for automatization from a practical perspective. In this context, our work can be seen as another step towards the automatization of lower bounds in the LOCAL model.
Permanent link
Publication status
published
External links
Editor
Book title
Proceedings of the 39th Symposium on Principles of Distributed Computing
Journal / series
Volume
Pages / Article No.
69 - 78
Publisher
Association for Computing Machinery
Event
39th Symposium on Principles of Distributed Computing (PODC 2020)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
09587 - Ghaffari, Mohsen (ehemalig) / Ghaffari, Mohsen (former)
Notes
Due to the Corona virus (COVID-19) the conference was conducted virtually.