Deterministic (δ + 1)-Coloring in Sublinear (in δ) Time in Static, Dynamic, and faulty networks

Keyphrases

• Vertex Coloring 100%
• Kuhn 100%
• Dynamic Networks 100%
• Faulty Network 100%
• Static Networks 100%
• Static-dynamic 100%
• Deterministic Algorithm 66%
• Edge Coloring 66%
• Distributed Symmetry Breaking 33%
• Graph Coloring 33%
• Log-log 33%
• Coloring Algorithm 33%
• Distributed Computing 33%
• Novel Technique 33%
• Edge-coloring Problem 33%
• Coloring Problem 33%
• Polynomial Systems 33%
• Number of Subgraphs 33%
• 2-coloring 33%
• List Coloring 33%

Computer Science

• Coloring Problem 100%
• Subgraphs 100%
• Fundamental Question 50%
• Distributed Computing 50%
• Speed-up 50%

Mathematics

• Edge 100%
• Polynomial 66%
• Running Time 33%
• Symmetry Breaking 33%
• List Coloring Problem 33%