Combinatorial algorithms for distributed graph coloring

Keyphrases

• Ad Hoc Networks 20%
• Algebraic Algorithms 40%
• Algebraic Construction 20%
• Algebraic Techniques 20%
• Bounded Arboricity 20%
• Central Field 20%
• Coloring Algorithm 20%
• Combinatorial Algorithms 100%
• Combinatorial Proof 20%
• Combinatorial Set 20%
• Communication Networks 20%
• Distributed Graph Coloring 100%
• Distributed Settings 20%
• Expander 20%
• General Graphs 20%
• Goldberg 20%
• Graph Coloring 20%
• Limited Resources 20%
• Maximal Independent Set 20%
• Maximum Degree 20%
• Mobile Networks 20%
• PCP Theorem 20%
• Set Systems 40%
• Shortest Path 20%
• Theoretical Computer Science 20%
• Vertex Coloring 40%

Computer Science

• Ad Hoc Network 50%
• Algebraic Algorithm 100%
• Communication Network 50%
• Efficient Algorithm 50%
• Graph Coloring 100%
• Maximal Independent Set 50%
• Mobile Network 50%
• Theoretical Computer Science 50%

Mathematics

• Algebraic Construction 20%
• Arboricity 20%
• Combinatorial Algorithm 100%
• Edge 20%
• Expander 20%
• Graph Coloring 100%
• Independent Set 20%
• Maximum Degree 20%
• Real Life 20%
• Running Time 20%