Optimal irreversible dynamos in chordal rings

Discrete Applied Mathematics

Volumn 113, Issue 1, 2001, Pages 23-42

  Flocchini, P ^a   Geurts, F ^b   Santoro, N ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Chordal rings; Dynamic monopolies; Majority rule

Indexed keywords

EID: 0345848052     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00388-7     Document Type: Article

References (23)

1. Z. Agur, A.S. Fraenkel, S.T. Klein, The number of fixed points of the majority rule, Discrete Math. 70 (1988) 295-302.
2. H. Attiya, J. van Leeuwen, N. Santoro, S. Zaks, Efficient elections in chordal ring networks, Algorithmica 4 (1989) 437-446.
3. J.C. Bermond, J. Bond, D. Peleg, S. Perennes, Tight bounds on the size of 2-monopolies, Proceedings of the Third Colloquium on Structural Information and Communication Complexity, 1996, pp. 170-179.
4. J.-C. Bermond, F. Comellas, D.F. Hsu, Distributed loop computer networks: a survey, J. Parallel Distributed Comput. 24 (1995) 2-10.
5. J.C. Bermond, D. Peleg, The power of small coalitions in graphs, Proceedings of the Second Colloquium on Structural Information and Communication Complexity, 1995, pp. 173-184.
6. R. De Prisco, A. Monti, L. Pagli, Efficient testing and reconfiguration of VLSI linear arrays, Theor. Comput. Sci. 197 (1998) 171-188.
7. P. Flocchini, R. Královič, A. Roncato, P. Ružička, N. Santoro, On time versus size for monotone dynamic monopolies, Proceedings of the Seventh Colloquium on Structural Information and Communication Complexity, 2000.
8. P. Flocchini, E. Lodi, F. Luccio, L. Pagli, N. Santoro, Irreversible dynamos in tori, Proceedings of EUROPAR 98, 1998, pp. 554-562.
9. P. Flocchini, E. Lodi, F. Luccio, L. Pagli, N. Santoro, Monotone dynamos in tori, Proceedings of the Sixth Colloquium on Structural Information and Communication Complexity, 1999, pp. 152-165.
10. E. Goles, S. Martinez, Neural and Automata Networks, Dynamical Behavior and Applications, Kluwer Academic Publishers, Dordrecht, 1990.
11. E. Goles, J. Olivos, Periodic behavior of generalized threshold functions, Discrete Math. 30 (1980) 187-189.
12. D. Krizanc, F.L. Luccio, Boolean routing on chordal rings, Proceedings of the Second Colloquium on Structural Information and Communication Complexity, 1995.
13. N. Linial, D. Peleg, Y. Rabinovich, M. Sachs, Sphere packing and local majority in graphs, Proceedings of the Second ISTCS, 1993, pp. 141-149.
14. F. Luccio, L. Pagli, H. Sanossian, Irreversible dynamos in butterflies, Proceedings of the Sixth Colloquium on Structural Information and Communication Complexity, 1999, pp. 204-218.
15. B. Mans, Optimal distributed algorithms in unlabeled tori and chordal rings, J. Parallel Distributed Comput. 46 (1) (1997) 80-90.
16. G. Moran, The r-majority vote action on 0-1 sequences, Discrete Math. 132 (1994) 145-174.
17. G. Moran, On the period-two-property of the majority operator in infinite graphs, Trans. Amer. Math. Soc. 347 (5) (1995) 1649-1667.
18. A. Nayak, N. Santoro, R. Tan, Fault-tolerance of reconfigurable systolic arrays, Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990, pp. 202-209.
19. Yi Pan, A near-optimal multi-stage distributed algorithm for finding leaders in clustered chordal rings, Inform. Sci. 76(1-2) (1994) 131-140.
20. D. Peleg, Local majority voting, small coalitions and controlling monopolies in graphs: a review, Proceedings of the Third Colloquium on Structural Information and Communication Complexity, 1997, pp. 152-169.
21. D. Peleg, Size bounds for dynamic monopolies, Proceedings of the Fourth Colloquium on Structural Information and Communication Complexity, 1997, pp. 151-161.
22. S. Poljak, Transformations on graphs and convexity, Complex Systems 1 (1987) 1021-1033.
23. N. Santoro, J. Ren, A. Nayak, On the complexity of testing for catastrophic faults, Proceedings of the Sixth International Symposium on Algorithms and Computation, 1995, pp. 188-197.