Brief Announcement: On the Voting Time of the Deterministic Majority Process
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...