2023
DOI: 10.48550/arxiv.2303.05250
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Distributed Half-Integral Matching and Beyond

Abstract: By prior work, it is known that any distributed graph algorithm that finds a maximal matching requires Ω(log * n) communication rounds, while it is possible to find a maximal fractional matching in O(1) rounds in bounded-degree graphs. However, all prior O(1)-round algorithms for maximal fractional matching use arbitrarily fine-grained fractional values. In particular, none of them is able to find a half-integral solution, using only values from {0, 1 2 , 1}. We show that the use of fine-grained fractional val… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 16 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?