Dynamic monopolies of constant size

Journal of Combinatorial Theory. Series B

Volumn 83, Issue 2, 2001, Pages 191-200

  Berger, Eli ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Dynamic monopolies; Fault handling in distributed systems; Graph; Majority process; Small coalition; Voting

Indexed keywords

EID: 0035197031     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2045     Document Type: Article

References (24)

1. Size bounds for dynamic monopolies
2. Periodic behavior of generalized threshold functions
3. On periodic behavior in societies with symmetric influences
4. Sphere packing and local majorities in graphs
5. The power of small coalitions in graphs
6. Tight bounds on the size of 2-monopolies
7. The Byzantine generals problem
8. An o(log n) expected rounds randomized Byzantine generals algorithms
9. Fault tolerance in networks of bounded degree
10. How to assign votes in a distributed system
11. Weighted voting for replicated data
12. Voting as the optimal static pessimistic scheme for managing replicated data
13. The availability of quorum systems
14. Efficient fault location with small risk
15. System diagnosis with smallest risk of error
16. Consistency in partitioned networks
17. Fault-local distributed mending
18. Tight fault-locality
19. Local majority voting, small coalitions and controlling monopolies in graphs: A review