Distributed symmetry-breaking algorithms for congested cliques

Keyphrases

• Distributed Symmetry Breaking 100%
• Congested Clique 100%
• Forest Decomposition 75%
• Arboricity 50%
• Symmetry Breaking 50%
• Maximal Independent Set 50%
• Number of Vertices 50%
• General Network 50%
• Vertex Coloring 25%
• General Graphs 25%
• Graph Families 25%
• Decomposition Algorithm 25%
• Planar Graph 25%
• Bounded Arboricity 25%
• Single-hop 25%
• Improved Algorithm 25%
• Time Algorithm 25%
• Large Cliques 25%
• Distributed Computing Models 25%
• Partitioning Method 25%

Mathematics

• Symmetry Breaking 100%
• Clique 100%
• Arboricity 50%
• Independent Set 33%
• Running Time 16%
• Communicates 16%
• Decomposition Algorithms 16%
• Planar Graph 16%

Computer Science

• Maximal Independent Set 100%
• Subgraphs 100%
• Planar Graph 50%
• Distributed Computing 50%
• Partitioning Technique 50%