Citations of

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

  1. Hisham Anwer, Algebraic Graph Theory and Applications, PHD Thesis, 2007.

  2. John Goldwasser, Xinmao Wang, and Yaokun Wu, Does the lit-only restriction make any difference for the σ-game and σ+-game? European Journal of Combinatorics, 30(4): 774—787, 2009.

  3. Yunting Lu and Yueping Li, The Minimum All-Ones Problem for Graphs with Small Treewidth, Combinatorial optimization and application, Lecture Notes in Computer Science, 46(16): 335-342, 2007.

  4. Frédéric Meunier, Pleins étiquetages et con_gurations équilibrées : aspects topologiques de l'Optimisation Combinatoire, PHD Thesis, 2006.

  5. Xinmao Wang, Yaokun Wu, Difference between minimum light numbers of sigma-game and lit-only sigma-game, Arxiv preprint arXiv:0904.3050, 2009.

  6. Xinmao Wang and Yaokun Wu, Minimum light number of lit-only δ-game on a tree, Theoretical Computer Science, 381: 292–300, 2007.

back to homepage