A generic MinMax algorithm solves stabilizing consensus for anonymous synchronous agents in time-varying topologies whenever every bounded period contains a root that reaches all agents.
Stabilizing consensus with the power of two cho ices
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
MinMax Algorithms for Stabilizing Consensus
A generic MinMax algorithm solves stabilizing consensus for anonymous synchronous agents in time-varying topologies whenever every bounded period contains a root that reaches all agents.