A one-round next-higher-ID neighbor selection rule achieves backup placement with load at most c in graphs of neighborhood independence c, and enables a (2+epsilon)-approximate maximum matching in O(log* n) rounds.
Det erministic distributed (delta+ o (delta))- edge-coloring, and vertex-coloring of graphs with bounded diversity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization
A one-round next-higher-ID neighbor selection rule achieves backup placement with load at most c in graphs of neighborhood independence c, and enables a (2+epsilon)-approximate maximum matching in O(log* n) rounds.