The complexity of the bootstraping percolation and other problems
暂无分享,去创建一个
Eric Goles Ch. | Pedro Montealegre-Barba | Ioan Todinca | E. Ch. | Ioan Todinca | Pedro Montealegre-Barba
[1] Indranil Gupta,et al. ContagAlert: Using Contagion Theory for Adaptive, Distributed Alert Propagation , 2006, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06).
[2] Martín Matamala,et al. Small Alliances in Graphs , 2007, MFCS.
[3] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .
[4] H. James Hoover,et al. Limits to Parallel Computation: P-Completeness Theory , 1995 .
[5] Robert A. Meyers. Encyclopedia of Complexity and Systems Science - v. 1-10 , 2009 .
[6] Cristopher Moore. Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness , 1997 .
[7] J. Balogh,et al. Random disease on the square grid , 1998 .
[8] Cristopher Moore,et al. Life Without Death is P-complete , 1997, Complex Syst..
[9] S. S. Manna. Abelian cascade dynamics in bootstrap percolation , 1998 .
[10] S. Rao Kosaraju,et al. An NC Algorithm for Evaluating Monotone Planar Circuits , 1995, SIAM J. Comput..
[11] Ivan Rapaport,et al. On Dissemination Thresholds in Regular and Irregular Graph Classes , 2009, Algorithmica.
[12] P. Leath,et al. Bootstrap percolation on a Bethe lattice , 1979 .