Approximate agreement on graphs is t-resilient solvable in asynchronous systems if and only if the graph's clique complex is (t-1)-connected, with separations shown between agreement variants.
27 Eli Gafni and Elias Koutsoupias
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Solvability of Approximate Agreement on Graphs and Simplicial Complexes
Approximate agreement on graphs is t-resilient solvable in asynchronous systems if and only if the graph's clique complex is (t-1)-connected, with separations shown between agreement variants.