An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs

Keyphrases

• Hamiltonian Path Problem 100%
• Distance-hereditary Graphs 100%
• Parallel Strategy 100%
• Decomposition Tree 66%
• Linear-time Algorithm 33%
• Sequential Algorithm 33%
• EREW PRAM 33%
• PRAM Model 33%
• Tree Form 33%

Computer Science

• Tree Decomposition 100%
• Hamiltonian Path 100%
• Sequential Algorithm 50%

Mathematics

• Path Problem 100%
• Linear Time 50%
• EREW PRAM 50%