Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication
Christian Konrad,
Peter Robinson,
Viktor Zamaraev
Abstract:We give lower bounds on the communication complexity of graph problems in the multi-party blackboard model. In this model, the edges of an -vertex input graph are partitioned among parties, who communicate solely by writing messages on a shared blackboard that is visible to every party. We show that any non-trivial graph problem on -vertex graphs has blackboard communication complexity Ω( ) bits, even if the edges of the input graph are randomly assigned to the parties. We say that a graph problem is non-trivi… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.