Sublinear algorithms for (∆ + 1) vertex coloring

Keyphrases

• Sublinear Algorithms 100%
• Vertex Coloring 100%
• Massively Parallel Computation 50%
• Proper Coloring 50%
• Greedy Algorithm 33%
• Log-log 33%
• Maximal Independent Set 33%
• Maximal Matching 33%
• Set Matching 33%
• Semi-streaming Algorithms 33%
• High Probability 16%
• Computational Algorithm 16%
• Distributed Algorithms 16%
• Parallel Algorithm 16%
• Sublinear Time 16%
• Streaming Model 16%
• Graph Streaming 16%
• Coloring Problem 16%
• New Lower Bound 16%
• Maximum Degree 16%
• Parallel Process Model 16%
• Query Model 16%
• Folklore 16%
• Linear Time 16%
• Canonical Class 16%
• Neighbor Query 16%
• Dynamic Stream 16%
• Color Set 16%
• Linear Space 16%
• Round numbers 16%
• Meta-algorithm 16%
• Proper Vertex Coloring 16%
• Valid Coloring 16%

Mathematics

• Probability Theory 100%
• Independent Set 100%
• Greedy Algorithm 100%
• Linear Time 50%
• Upper Bound 50%
• Main Result 50%
• Maximum Degree 50%
• Sample Problem 50%
• Sharp Contrast 50%

Computer Science

• Parallel Computation 100%
• Maximal Independent Set 66%
• Maximal Matching 66%
• Greedy Algorithm 66%
• Fundamental Question 33%
• Efficient Algorithm 33%
• Coloring Problem 33%
• Constant Probability 33%
• Parallel Algorithm 33%
• Distributed Algorithm 33%