Sciweavers

Share
IPL
2002

New bounds on a hypercube coloring problem

9 years 6 months ago
New bounds on a hypercube coloring problem
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of
Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where IPL
Authors Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham
Comments (0)
books