Minimal change list for Lucas strings and some graph theoretic consequences
暂无分享,去创建一个
[1] Jie Wu. Extended Fibonacci Cubes , 1997, IEEE Trans. Parallel Distributed Syst..
[2] Philippe Flajolet,et al. Introduction à l'analyse des algorithmes , 1996 .
[3] Timothy Walsh,et al. Generating Gray Codes in O(1) Worst-Case Time per Word , 2003, DMTCS.
[4] Frank Ruskey,et al. Generating Linear Extensions Fast , 1994, SIAM J. Comput..
[5] Vincent Vajnovszki. A Loopless Generation of Bitstrings without p Consecutive Ones , 2001, DMTCS.
[6] Wen-Jing Hsu,et al. Generalized fibonacci cubes are mostly hamiltonian , 1994, J. Graph Theory.
[7] Ernesto Dedó,et al. The observability of the Fibonacci and the Lucas cubes , 2002, Discret. Math..
[8] Emanuele Munarini,et al. On the Lucas cubes , 2001 .
[9] Albert Nijenhuis,et al. Combinatorial Algorithms for Computers and Calculators , 1978 .