Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
暂无分享,去创建一个
[1] Ning Chen,et al. On the approximability of influence in social networks , 2008, SODA '08.
[2] Mihalis Yannakakis,et al. Node-and edge-deletion NP-complete problems , 1978, STOC.
[3] Frank Harary,et al. Graph Theory , 2016 .
[4] 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..
[5] Manouchehr Zaker,et al. On dynamic monopolies of graphs: The average and strict majority thresholds , 2012, Discret. Optim..
[6] Noga Alon,et al. Large induced degenerate subgraphs , 1987, Graphs Comb..
[7] Tomás Kulich. Dynamic monopolies with randomized starting configuration , 2011, Theor. Comput. Sci..
[8] Manouchehr Zaker. On dynamic monopolies of graphs with general thresholds , 2012, Discret. Math..
[9] Sarah Spence Adams,et al. Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products , 2013, Australas. J Comb..
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Eyal Ackerman,et al. Combinatorial model and bounds for target set selection , 2010, Theor. Comput. Sci..
[12] Paul Booth,et al. Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids , 2012, Discret. Appl. Math..
[13] Paola Flocchini,et al. On time versus size for monotone dynamic monopolies in regular topologies , 2000, SIROCCO.
[14] Ching-Lueh Chang,et al. On irreversible dynamic monopolies in general graphs , 2009, ArXiv.
[15] Béla Bollobás,et al. Bootstrap percolation on the hypercube , 2006 .
[16] D. de Werra,et al. Graph Coloring Problems , 2013 .
[17] Nicholas C. Wormald,et al. Induced Forests in Regular Graphs with Large Girth , 2008, Comb. Probab. Comput..