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

Keyphrases

• Fault Model 100%
• N-cube 100%
• Path Embedding 100%
• Hamiltonian Path 100%
• Fault-tolerant 33%
• Fault Tolerance 33%
• Building Networks 16%
• Parallel Computing 16%
• Interconnection Networks 16%
• Node number 16%
• Conditional Fault Model 16%
• Data Center Networks 16%
• Success Rate 16%
• In-network Computing 16%
• Network on chip 16%
• Embedding Method 16%
• Adjacent Nodes 16%
• Parallel Computer 16%
• Large-scale Networks 16%
• Average Path Length 16%
• Performance Analysis 16%
• Linear Fault 16%
• Faulty Edge 16%
• Fault-free Path 16%
• Path Structures 16%
• Edge Fault Tolerance 16%
• Theoretical Proof 16%
• Embedding Algorithm 16%
• Dynamic Degradation 16%

Computer Science

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