Distributed deterministic edge coloring using bounded neighborhood independence

Computer Science

• Coloring Problem 100%
• Distributed Computing 50%
• Fundamental Problem 50%
• Graph Coloring 50%
• Hyperedges 50%
• Message Passing 50%
• Randomized Algorithm 50%
• Speed-up 50%

Keyphrases

• Bounded Growth 9%
• Color number 9%
• Coloring Algorithm 36%
• Deterministic Algorithm 27%
• Distributed Computing 9%
• Edge Coloring 100%
• Edge-coloring Problem 9%
• General Graphs 9%
• Graph Coloring 18%
• Graph Families 9%
• Hyperedge 9%
• Hypergraph 18%
• Large Families 9%
• Line Graph 9%
• Log-log 18%
• Maximum Degree 18%
• Message Passing Model 9%
• Randomized Algorithms 9%
• Superlinear 9%
• Vertex Coloring 27%
• Vertex Coloring Problem 9%