On the k-ary hypercube

DOI10.1016/0304-3975(94)00197-QzbMath0873.68013OpenAlexW2016257604MaRDI QIDQ673771

Saïd Bettayeb

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00197-q

zbMATH Keywords

binary hypercube

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (13)

Path embeddings in faulty 3-ary \(n\)-cubes ⋮ Augmented \(k\)-ary \(n\)-cubes ⋮ An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation ⋮ The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks ⋮ On some similarity of finite sets (and what we can say today about certain old problem) ⋮ Distance magic labeling of the halved folded \(n\)-cube ⋮ EMPLOYINGK-ARY n-CUBES FOR PARALLEL LAGRANGE INTERPOLATION ⋮ Distance magic labeling of the halved folded \(n\)-cube ⋮ Parallel Lagrange interpolation on \(k\)-ary \(n\)-cubes with maximum channel utilization ⋮ Survey on path and cycle embedding in some networks ⋮ Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks ⋮ Structure fault tolerance of \(k\)-ary \(n\)-cube networks ⋮ Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding grids into hypercubes
• Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
• Encoding Data Structures in Trees
• On Embedding Rectangular Grids in Square Grids
• Bounds on the costs of data encodings

This page was built for publication: On the k-ary hypercube