Algorithms for coloring semi-random graphs

Keyphrases

• Almost Surely 100%
• Polynomial Time 100%
• Polynomial-time Algorithm 100%
• Graph Coloring 100%
• Random Graphs 100%
• Approximate Solution 50%
• Adversary 50%
• NP-hard 50%
• Worst-case Performance 50%
• Approximation Algorithms 50%
• Distribution Class 50%
• Proof Techniques 50%
• Equal Probability 50%
• Random Model 50%
• K-coloring 50%

Mathematics

• Polynomial Time 100%
• Polynomial 50%
• Worst Case 50%
• Probability Theory 50%
• Graph Coloring 50%
• Edge 50%
• Wide Range 25%
• Approximate Solution 25%
• Running Time 25%
• Positive Constant 25%
• Time Average 25%
• Random Model 25%
• Colorable Graph 25%