On \(k\)-ary \(n\)-cubes: Theory and applications.

DOI10.1016/S0166-218X(02)00238-XzbMath1048.68063MaRDI QIDQ1399117

Weizhen Mao, David M. Nicol

Publication date: 30 July 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

communicationParallel processinggraph partitioning\(k\)-ary \(n\)-cubes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Quaternary \(n\)-cubes and isometric words ⋮ Matching preclusion for \(k\)-ary \(n\)-cubes ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Two important parameters of HPMC model ⋮ Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes ⋮ On \(k\)-ary \(n\)-cubes and isometric words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
• Edge-isoperimetric inequalities in the grid
• Edge isoperimetric theorems for integer point arrays
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Optimal Assignments of Numbers to Vertices

This page was built for publication: On \(k\)-ary \(n\)-cubes: Theory and applications.