MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Local majority voting, small coalitions and controlling monopolies in graphs: A review (1996) [25 citations — 0 self]

Download:
pdf | ps
by D. Peleg
In Proc. of 3rd Colloquium on Structural Information and Communication Complexity
ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-12.ps.Z
Add To MetaCart

Abstract:

This paper provides an overview of recent developments concerning the process of local majority voting in graphs, and its basic properties, from graph theoretic and algorithmic standpoints.

Citations

670 Extremal Graph Theory – Bollobás - 1978
459 Weighted voting for replicated data – Gifford - 1979
351 A threshold of ln n for approximating set cover – Feige - 1998
317 On the hardness of approximating minimization problems – Lund, Yannakakis - 1994
284 Byzantine quorum systems – Malkhi, Reiter - 1998
203 Sphere Packings, Lattices and Groups – Conway, Sloane - 1999
166 How to Assign Votes in a Distributed System – Molina, Barbara, et al. - 1985
128 A quorum-consensus replication method for abstract data types – Herlihy - 1986
100 Combinatorial Theory – HALL - 1980
92 Algorithms for Mutual Exclusion – Raynal - 1986
81 An optimal synchronizer for the hypercube – Peleg, Ullman - 1987
48 Fault-local distributed mending – Kutten, Peleg - 1995
37 On the ratio of optimal integral and fractional covers. Discrete Math – Lovasz - 1975
30 Eigenvalues and Expansion of Regular Graphs – Kahale - 1995
29 An O(log n) expected rounds randomized Byzantine generals protocol – Bracha - 1987
22 Voting as the optimal static pessimistic scheme for managing replicated data – Spasojevic, Berman - 1994
19 On periodical behaviour in societies with symmetric influences – Poljak, Sura - 1983
19 An analysis of the greedy algorithm for the submodular set covering problem – Wolsey - 1982
14 The r-majority vote action on 0-1 sequences – Moran - 1994
14 On the period-two-property of the majority operator in infinite graphs – Moran - 1995
12 Parametrization for stationary patterns of the r-majority operators on 0-1 sequences – Moran - 1994
11 Tight fault-locality – Kutten, Peleg - 1995
10 Quorum Systems for Distributed Control Protocols – Wool - 1996
9 On an application of convexity to discrete systems – Poljak, Turzik - 1986
8 Fixed points of majority rule cellular automata with application to plasticity and precision of the immune system – Agur - 1988
6 Worst Case Analysis of Greedy Heuristics For Integer Programming with NonNegative Data – Dobson - 1980
6 On a paper by Agur – Granville - 1991
6 The complexity of system-level fault diagnosis and diagnosability – Sullivan - 1986
5 Efficient fault location with small risk – Pelc - 1996
4 System diagnosis with smallest risk of error – Diks, Pelc - 1996
4 Periodic behaviour of generalized threshold functions – Goles, Olivos - 1980
2 Graph Immunity Against Local Influence – Peleg - 1996
1 Resilience and variability in pathogens and hosts – Agur - 1987
1 The Power of Small Coalitions in Graphs. Proc. 2nd Colloq. on Structural Information & Communication Complexity – Bermond, Peleg - 1995
1 Size Bounds for Dynamic Monopolies. Unpublished Manuscript – Peleg - 1996