Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
暂无分享,去创建一个
[1] Fred S. Roberts,et al. GRAPH-THEORETIC MODELS OF SPREAD AND COMPETITION , 2004 .
[2] Jon Kleinberg,et al. Maximizing the spread of influence through a social network , 2003, KDD '03.
[3] Paul Booth,et al. Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids , 2012, Discret. Appl. Math..
[4] Nabil H. Mustafa,et al. Majority Consensus and the Local Majority Rule , 2001, ICALP.
[5] Manouchehr Zaker,et al. A Study of Monopolies in Graphs , 2013, Graphs Comb..
[6] Eli Berger. Dynamic Monopolies of Constant Size , 2001, J. Comb. Theory, Ser. B.
[7] Ching-Lueh Chang,et al. Bounding the Number of Tolerable Faults in Majority-Based Systems , 2010, CIAC.
[8] Jayme Luiz Szwarcfiter,et al. Brief Announcement: On Reversible and Irreversible Conversions , 2010, DISC.
[9] Manouchehr Zaker. On dynamic monopolies of graphs with general thresholds , 2012, Discret. Math..
[10] Fabrizio Luccio,et al. Monotone Dynamos in Tori , 1999, SIROCCO.
[11] Fred S. Roberts,et al. Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion , 2009, Discret. Appl. Math..
[12] Manouchehr Zaker,et al. On dynamic monopolies of graphs: The average and strict majority thresholds , 2012, Discret. Optim..
[13] E. Sampathkumar. On tensor product graphs , 1975 .
[14] D. Peleg. Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review , 1996 .
[15] David Peleg,et al. Size Bounds for Dynamic Monopolies , 1998, Discret. Appl. Math..
[16] Fabrizio Luccio,et al. Dynamic monopolies in tori , 2004, Discret. Appl. Math..
[17] J. Kynčl,et al. Irreversible 2-conversion set is NP-complete , 2009 .
[18] Nabil H. Mustafa,et al. Listen to Your Neighbors: How (Not) to Reach a Consensus , 2004, SIAM J. Discret. Math..