Tight network topology dependent bounds on rounds of communication

Keyphrases

• Tight 100%
• Network Topology 100%
• Two-party Communication 100%
• Communication Difficulties 66%
• Proof Techniques 33%
• General Graphs 33%
• Multi-commodity 33%
• Distributed Computing 33%
• Graph Topology 33%
• Round Complexity 33%
• CONGEST Model 33%
• Network Coding 33%
• Delay Constraint 33%
• Communication Complexity 33%
• Underlying Network 33%
• Total Communication 33%
• Element Distinctness 33%
• Set Disjointness 33%
• Distributed Graph Processing 33%
• Steiner Tree Packing 33%
• Party Functions 33%

Computer Science

• Network Topology 100%
• Communication Problem 66%
• Distributed Computing 33%
• steiner tree 33%
• Topology Graph 33%
• Network Coding 33%
• Proof Technique 33%
• Delay Constraint 33%
• Graph Computation 33%
• Problem Complexity 33%
• Communication Complexity 33%
• Underlying Network 33%