✦ LIBER ✦

On the multisearching problem for hypercubes

✍ Scribed by Mikhail J. Atallah; Andreas Fabri

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 561 KB
Volume: 5
Category: Article
ISSN: 0925-7721
DOI: 10.1016/0925-7721(94)00023-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

QR factorization for the regularized lea

QR factorization for the regularized least squares problem on hypercubes

✍ Jianping Zhu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Solving the symmetric tridiagonal eigenv

Solving the symmetric tridiagonal eigenvalue problem on hypercubes

✍ Kuo-Liang Chung; Wen-Ming Yan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 407 KB

On a leverage problem in the hypercube

✍ Peter Hamburger; Raymond E. Pippert; W. Douglas Weakley 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

The steiner problem in the hypercube

✍ Zevi Miller; Manley Perkel 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 976 KB

New bounds on a hypercube coloring probl

New bounds on a hypercube coloring problem

✍ Hung Quang Ngo; Ding-Zhu Du; Ronald L. Graham 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 57 KB

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 χ k (n), the minimum number of

A hypercube algorithm for the 0/1 Knapsa

A hypercube algorithm for the 0/1 Knapsack problem

✍ Jong Lee; Eugene Shragowitz; Sartaj Sahni 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 878 KB