Irreversible conversion processes with deadlines

Agur, 1991, Fixed points of majority rule cellular automata with application to plasticity and precision of the immune system, Complex Syst., 5, 351 Allouche, 2001, Notes on cellular automata, CUBO, 3, 213 Alon, 2008 Balister, 2010, Random majority percolation, Random Struct. Algorithms, 36, 315 Bermond, 2003, The power of small coalitions in graphs, Discrete Appl. Math., 127, 399, 10.1016/S0166-218X(02)00241-X Centeno, 2011, Irreversible conversion of graphs, Theor. Comput. Sci., 412, 3693, 10.1016/j.tcs.2011.03.029 Domingos, 2001, Mining the network value of customers, 57 Dreyer, 2009, Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion, Discrete Appl. Math., 157, 1615, 10.1016/j.dam.2008.09.012 Fink, 1985, n-domination in graphs, 282 Flocchini, 2001, Optimal irreversible dynamos in chordal rings, Discrete Appl. Math., 113, 23, 10.1016/S0166-218X(00)00388-7 Flocchini, 2003, On time versus size for monotone dynamic monopolies in regular topologies, J. Discrete Algorithms, 1, 129, 10.1016/S1570-8667(03)00022-4 French, 1956, A formal theory of social power, Psychol. Rev., 63, 181, 10.1037/h0046123 Haynes, 1998 Henning, 1998, Distance domination in graphs, 335 Huang, 1999, Gene expression profiling, genetic networks, and cellular states: an integrating concept for tumorigenesis and drug discovery, J. Mol. Med., 77, 469, 10.1007/s001099900023 Kempe, 2003, Maximizing the spread of influence through a social network, 137 Kutten, 1999, Fault-local distributed mending, J. Algorithms, 30, 144, 10.1006/jagm.1998.0972 Mustafa, 2004, Listen to your neighbors: How (not) to reach a consensus, SIAM J. Discrete Math., 17, 634, 10.1137/S0895480102408213 Peleg, 2002, Local majorities, coalitions and monopolies in graphs: A review, Theor. Comput. Sci., 282, 231, 10.1016/S0304-3975(01)00055-X Poljak, 1983, On periodical behaviour in societies with symmetric influences, Combinatorica, 3, 119, 10.1007/BF02579347