2000 character limit reached
The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential
Published 27 Apr 2016 in cs.DC | (1604.08066v3)
Abstract: Manne et al. designed the first algorithm computing a maximal matching that is a 2/3 -approximation of the maximum matching in $O(2n)$ moves. However, the complexity tightness was not proved. In this paper, we exhibit a sub-exponential execution of this matching algorithm.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.