Content-oblivious leader election is possible in all 2-edge-connected networks (with a known size bound) and on unoriented rings (with no bound), resolving two open conjectures.
Distributed algorithms made secure: A graph theoretic approach
1 Pith paper cite this work, alongside 8 external citations. Polarity classification is still indexing.
1
Pith paper citing it
8
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Content-Oblivious Leader Election in 2-Edge-Connected Networks
Content-oblivious leader election is possible in all 2-edge-connected networks (with a known size bound) and on unoriented rings (with no bound), resolving two open conjectures.