Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems

Keyphrases

• Exponential-time Algorithm 100%
• Asymptotically-tight 66%
• General Graphs 33%
• Tutte Polynomial 33%
• Potts Model 33%
• Monte Carlo Algorithm 33%
• Cycle Graph 33%
• Superpolynomials 33%
• NP-hard Problem 33%
• Doubly Exponential 33%
• Exponential Time Hypothesis 33%
• All-terminal Network Reliability 33%
• Three-state 33%
• Brute Force 33%
• Model Partition 33%

Mathematics

• Planar Graph 100%
• Simple Graph 66%
• Fixed Points 33%
• Hamiltonian Cycle 33%
• NP-hard Problem 33%
• Edge 33%
• Monte Carlo Algorithm 33%
• Polynomial Time 33%