Citations of

William Y.C. Chen, Xueliang Li, Chao Wang and Xiaoyan Zhang, The minimum all-ones problem for trees, SIAM J. Computing 33 (2004), No. 2, 379–392.

  1. H. Broersma and X.L. Li, On the complexity of dominating set problems related to the minimum all-ones problem, Theoret. Comput. Sci. 385 (2007) 60-70.

  2. W,Y.C. Chen and Nancy S.S. Gu, Loop Deletion for the Lamp Lignting Problem.

  3. W,Y.C. Chen, X.L. Li, C. Wang and X.Y. Zhang, Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs, Electron. Notes Discrete Math. 17(2004) 93-98.

  4. J. Goldwasser, X.M. Wang and Y.K. Wu, Does the lit-only restriction make any difference for the σ-game and -game? European J. Combin. 30(2009) 774--787.

  5. R. Fleischer and J.J. Yu, A Survey of the Game “Lights Out!”, Space-Efficient Data Structures, Streams, and Algorithms 176--198.

  6. X.L. Li, C. Wang and X.Y. Zhang, The general σ all-ones problem for trees, Discret Appl. Math. 156(2008) 1790--1801.

  7. X.L. Li and X.Y. Zhang, New versions of the all-ones problem, arXiv:math/0512011.

  8. 李学良, 张晓岩。 三种新变形的全一问题, 数学物理学报, (2008) 619-626.

  9. Y.T. Lu and Y.P. Li, The Minimum All-Ones Problem for Graphs with Small Treewidth, Combinatorial optimization and application, Lecture Notes in Computer Science, 46(2007) 335-342.

  10. P. Manuel, I. Rajasingh, B. Rajan and R. Prabha, The All-Ones Problem For Binomial Trees, Butterflay And Benes Networks, International Journal of Mathematics and Soft Computing 2(2012) 1-6.

  11. F. Meunier, Pleins étiquetages et configurations équilibrées : aspects topologiques de l'Optimisation Combinatoire, Ph.D thesis, Universit´e Joseph-Fourier - Grenoble I, 2006.

  12. 平征,满二叉树上σ全一问题, 《凯里学院学报》 (2014) 8-10.

  13. 平征,钱建国,林启法,三角格上的σ全一问题, 纯粹数学与应用数学, (2011) 107-115.

  14. X.M. Wang and Y.K. Wu, Minimum light number of lit-only σ-game on a tree, Theor. Comput. Sci. 38(2007) 292--300.

  15. X.M. Wang and Y.K. Wu, Difference between minimum light numbers of sigma-game and lit-only sigma-game, arXiv:0904.3050.

back to homepage