On bottleneck partitioning of k-ARY n-cubes

Keyphrases

• Communication Cost 100%
• N-cube 100%
• Node number 50%
• Parallel Processing 50%
• Computation Cost 50%
• Graph Partitioning 50%
• General Graphs 50%
• Optimal Partition 50%
• Hypercube Graph 50%
• Context Graph 50%
• Node Weight 50%

Computer Science

• Communication Cost 100%
• Parallel Processing 50%
• Computation Cost 50%
• Graph Partition 50%