A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
32nd Int'l Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012
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 as input). Our main results are: An Ω(n) lower bound on the quantum communication complexity of deciding whether an n-vertex graph G is connected, nearly matching the trivial classical upper bound of O(n log n) bits of communication. A deterministic upper bound of O(n 3/2 log n) bits for deciding if a bipartite graphfatcat:eo5mvq72lrcbfhagi6imkpze4u