论文信息 - Leafy spanning trees in hypercubes - 字舞流文

Leafy spanning trees in hypercubes

William Duckworth | Alan Gibbons | Michele Zito | Paul E. Dunne | A. Gibbons | P. Dunne | M. Zito | W. Duckworth

[1] P. Hliněný,et al. Another two graphs with no planar covers , 2001 .

[2] R. Ravi,et al. Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.

[3] P. Cull,et al. Perfect codes on graphs , 1997, Proceedings of IEEE International Symposium on Information Theory.

[4] Francesco Maffioli,et al. A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem , 1994, Inf. Process. Lett..

[5] Sul-Young Choi,et al. A spanning tree of the 2m-dimensional hypercube with maximum number of degree-preserving vertices , 1993, Discret. Math..

[6] F. Harary,et al. Independent domination in hypercubes , 1993 .

[7] Maurice Tchuente,et al. Arbres avec un nombre maximum de sommets pendants , 1984, Discret. Math..

[8] James A. Storer,et al. Constructing Full Spanning Trees for Cubic Graphs , 1981, Inf. Process. Lett..

[9] Hsueh-I Lu,et al. A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree , 1996 .

[10] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.