Deterministic (Δ + 1)-Coloring in sublinear (in Δ) Time in static, dynamic and faulty networks

Keyphrases

• Vertex Coloring 100%
• Edge Coloring 100%
• Dynamic Networks 100%
• Faulty Network 100%
• Static Networks 100%
• Static-dynamic 100%
• Deterministic Algorithm 66%
• Distributed Symmetry Breaking 33%
• Message Passing Model 33%
• Communication Networks 33%
• Round numbers 33%
• Maximum Degree 33%
• Graph Coloring 33%
• Log-log 33%
• Coloring Algorithm 33%
• Distributed Computing 33%
• Dynamic Setting 33%
• Novel Technique 33%
• Coloring Problem 33%
• Polynomial Systems 33%
• Number of Subgraphs 33%
• 2-coloring 33%
• List Coloring 33%
• Local Computation 33%
• Struction 33%
• Network Change 33%

Computer Science

• Subgraphs 100%
• Message Passing 50%
• Communication Network 50%
• Coloring Problem 50%
• Fundamental Question 50%
• Distributed Computing 50%
• Speed-up 50%
• Computed Solution 50%