Distributed half-integral matching and beyond
Work
Year: 2023
Type: article
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... more
Source: Theoretical Computer Science
Authors Sameep Dahal, Jukka Suomela
Institution Aalto University
Cites: 16
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,690
Funder Academy of Finland
Grant ID 333837