Brief Announcement: On the Voting Time of the Deterministic Majority Process - DIStributed Computing 2015
Conference Papers Year : 2015

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.

Domains

Distributed, Parallel, and Cluster Computing [cs.DC]
Fichier principal
Vignette du fichier
13-BA.pdf (180.14 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Matthieu Roy  : Connect in order to contact the contributor

https://hal.science/hal-01207836

Submitted on : Thursday, October 1, 2015-2:16:43 PM

Last modification on : Friday, April 19, 2024-4:18:57 PM

Long-term archiving on : Saturday, January 2, 2016-11:06:45 AM

Download

Dates and versions

hal-01207836 , version 1 (01-10-2015)

Identifiers

  • HAL Id : hal-01207836 , version 1

Cite

Dominik Kaaser, Frederik Mallmann-Trenn, Emanuele Natale. Brief Announcement: On the Voting Time of the Deterministic Majority Process. DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨hal-01207836⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

ENS-PARIS DISC2015 PSL
229 View
99 Download

Share

More