An Efficient Algorithm for Hamiltonian Path Embedding of k-Ary n-Cubes Under the Partitioned Edge Fault Model

Computer Science

• Efficient Algorithm 100%
• Hamiltonian Path 100%
• Fault Tolerant 50%
• fault-tolerance 50%
• Parallel Computer 33%
• Data Center 16%
• Networks on Chips 16%
• Desirable Property 16%
• Average Path Length 16%
• Performance Analysis 16%
• Embedding Algorithm 16%
• Interconnection Network 16%

Keyphrases

• Faulty Edges 16%
• Fault-tolerant Paths 16%
• Linear Fault 16%
• Chip Data 16%