New bounds on the classical and quantum communication complexity of some graph properties

Gabor Ivanyos, Hartmut Klauck, Troy Lee +2

We study the communication complexity of a number of graph properties where the edges of the graph $G$ are distributed between Alice and Bob (i.e., each receives some of the edges…