Brief Announcement: On the Voting Time of the Deterministic Majority Process

Abstract : We study the deterministic binary majority process which is defined as fol- lows. We are given a graph G = (V,E) where each node has one out of two opinions. The process runs in discrete rounds where in every round each node computes and adopts the majority opinion among all of its neighbors.
Document type :
Conference papers
Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing
Liste complète des métadonnées

Cited literature [6 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01207836
Contributor : Matthieu Roy <>
Submitted on : Thursday, October 1, 2015 - 2:16:43 PM
Last modification on : Wednesday, September 28, 2016 - 3:42:44 PM
Document(s) archivé(s) le : Saturday, January 2, 2016 - 11:06:45 AM

File

13-BA.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01207836, version 1

Collections

Citation

Dominik Kaaser, Frederik Mallmann-Trenn, Emanuele Natale. Brief Announcement: On the Voting Time of the Deterministic Majority Process. Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing. 〈hal-01207836〉

Share

Metrics

Record views

104

Files downloads

60