A new analysis of an existing local algorithm yields O(log lambda)-round LOCAL and O(sqrt(log lambda) log log lambda)-round sublinear-space MPC algorithms for (1+epsilon)-approximate allocation in graphs of arboricity lambda.
Coresets meet edcs: algorithms for matching and vertex cover on massive graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
A new analysis of an existing local algorithm yields O(log lambda)-round LOCAL and O(sqrt(log lambda) log log lambda)-round sublinear-space MPC algorithms for (1+epsilon)-approximate allocation in graphs of arboricity lambda.