On the k-ary hypercube
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4064517 (Why is no real title available?)
- scientific article; zbMATH DE number 4064518 (Why is no real title available?)
- Bounds on the costs of data encodings
- Embedding grids into hypercubes
- Encoding Data Structures in Trees
- On Embedding Rectangular Grids in Square Grids
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
Cited in
(20)- Super \(C_k\) and sub-\( C_k\) connectivity of \(k\)-ary \(n\)-cube networks
- Structure fault tolerance of \(k\)-ary \(n\)-cube networks
- Survey on path and cycle embedding in some networks
- Distance magic labeling of the halved folded \(n\)-cube
- Lee distance and topological properties of k-ary n-cubes
- Distance magic labeling of the halved folded \(n\)-cube
- EMPLOYINGK-ARY n-CUBES FOR PARALLEL LAGRANGE INTERPOLATION
- scientific article; zbMATH DE number 2014480 (Why is no real title available?)
- Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
- scientific article; zbMATH DE number 5247093 (Why is no real title available?)
- Path embeddings in faulty 3-ary \(n\)-cubes
- Performance of hypercube architecture with shared memory
- Augmented \(k\)-ary \(n\)-cubes
- An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation
- On some similarity of finite sets (and what we can say today about certain old problem)
- The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks
- The bicube: an interconnection of two hypercubes
- Parallel Lagrange interpolation on \(k\)-ary \(n\)-cubes with maximum channel utilization
- Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
- On \(k\)-ary \(n\)-cubes: Theory and applications.
This page was built for publication: On the k-ary hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673771)
