Local majorities, coalitions and monopolies in graphs: A review
type: Item
instance of: scholarly article
title: Local majorities, coalitions and monopolies in graphs: A review
zbMATH Open document ID: 0997.68088
DOI: 10.1016/S0304-3975(01)00055-X
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1767914
zbMATH Keywords: local majority voting
author: David Peleg
MaRDI profile type: Publication
cites work: Q3355247
cites work: The number of fixed points of the majority rule
cites work: Dynamic monopolies of constant size
cites work: Q3852212
cites work: An O (log n ) expected rounds randomized byzantine generals protocol
cites work: Q4039784
cites work: Testing and reconfiguration of VLSI linear arrays
cites work: Reaching a Consensus
cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
cites work: Finite particle systems and infection models
cites work: Fault Tolerance in Networks of Bounded Degree
cites work: Q4228484
cites work: Q4944981
cites work: Dynamic monopolies in tori.
cites work: How to assign votes in a distributed system
cites work: Periodic behaviour of generalized threshold functions
cites work: Decreasing energy functions as a tool for studying threshold networks
cites work: On a paper of Agur, Fraenkel and Klein
cites work: Q3715120
cites work: Distributed probabilistic polling and applications to proportionate agreement
cites work: Ergodic theorems for weakly interacting infinite systems and the voter model
cites work: Eigenvalues and expansion of regular graphs
cites work: Time-adaptive self stabilization
cites work: Fault-Local Distributed Mending
cites work: Tight Fault Locality
cites work: The Byzantine Generals Problem
cites work: On the ratio of optimal integral and fractional covers
cites work: On the hardness of approximating minimization problems
cites work: The \(r\)-majority vote action on 0-1 sequences
cites work: Parametrization for stationary patterns of the \(r\)-majority operators on 0-1 sequences
cites work: Q4938673
cites work: Size bounds for dynamic monopolies
cites work: An Optimal Synchronizer for the Hypercube
cites work: The availability of quorum systems
cites work: On periodical behaviour in societies with symmetric influences
cites work: On an application of convexity to discrete systems
cites work: Q3813266
cites work: An analysis of the greedy algorithm for the submodular set covering problem
cites work: On the complexity of testing for catastrophic faults
full work available at URL: s0304-3975(01)00055-x
OpenAlex ID: W2066862787
description: scientific article; zbMATH DE number 1767914