Abstract
We study the multi-party communication model, where players correspond to the nodes of a graph and each player knows its neighbors in the input graph. The players can send messages on a whiteboard which are immediately available to each player. Eventually, the referee which knows only messages on the whiteboard is supposed to give a solution to the considered (graph) problem. We distinguish between oblivious and adaptive variant of the model. The former model is related to simultaneous multi-party communication complexity, while the latter is closely related to so-called broadcast congested clique.
Communication complexity is the maximum over all nodes of the sizes of messages put on the whiteboard by a node. Our goal is to study the impact of adaptivity on communication complexity of graph problems. We show that there exists an infinite hierarchy of problems with respect to the number of rounds for constant size messages. Moreover, motivated by unsuccessful attempts to establish non-adaptive communication complexity of graph connectivity in recent years, we study the connectivity problem in the severely restricted class of two-regular graphs We determine an asymptotically tight bound on communication complexity in the oblivious model and provide \(\omega (1)\) lower bound on the number of rounds in the adaptive model for some message size \(b(n)=\omega (1)\).
This work was supported by the National Science Centre, Poland grant 2017/25/B/ST6/02010
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: Discrete Algorithms, SODA 2012, pp. 459–467 (2012)
Becker, F., et al.: Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distrib. Comput. 28(3), 189–200 (2015)
Becker, F., Montealegre, P., Rapaport, I., Todinca, I.: The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism. In: Halldórsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 83–95. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09620-9_8
Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In: PODC 2014, pp. 367–376. ACM (2014)
Ghaffari, M., Parter, M.: MST in log-star rounds of congested clique. In: PODC 2016, pp. 19–28. ACM (2016)
Hegeman, J.W., Pandurangan, G., Pemmaraju, S.V., Sardeshmukh, V.B., Scquizzato, M.: Toward optimal bounds in the congested clique: graph connectivity and MST. In: Distributed Computing, PODC 2015, pp. 91–100. ACM (2015)
Hegeman, J.W., Pemmaraju, S.V.: Lessons from the congested clique applied to mapreduce. Theor. Comput. Sci. 608, 268–281 (2015)
Jurdzinski, T., Nowicki, T.: MST in O(1) rounds of congested clique. In: SODA 2018, SIAM, pp. 2620–2632 (2018)
Jurdzinski, T., Nowicki, K.: Brief announcement: on connectivity in the broadcast congested clique. In: DISC 2017, LIPIcs, pp. 54:1–54:4 (2017)
Kari, J., Matamala, M., Rapaport, I., Salo, V.: Solving the Induced Subgraph problem in the randomized multiparty simultaneous messages model. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 370–384. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25258-2_26
Karloff, H.J., Suri, S., Vassilvitskii, S.: A model of computation for mapreduce. In: SODA 2010, SIAM, pp. 938–948 (2010)
Klauck, H., Nanongkai, D., Pandurangan, G., Robinson, P.: Distributed computation of large-scale graph problems. In: SODA 2015, SIAM, pp. 391–410 (2015)
Korhonen, J.H., Suomela, J.: Brief announcement: towards a complexity theory for the congested clique. In: DISC 2017, pp. 55:1–55:3 (2017)
Montealegre, P., Todinca, I.: Brief announcement: deterministic graph connectivity in the broadcast congested clique. In: PODC 2016. ACM (2016)
Phillips, J.M., Verbin, E., Zhang, Q.: Lower bounds for number-in-hand multiparty communication complexity, made easy. In: SODA 2012, SIAM, pp. 486–501 (2012)
Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: STOC 1979, pp. 209–213. ACM (1979)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Jurdzinski, T., Lorys, K., Nowicki, K. (2018). Communication Complexity in Vertex Partition Whiteboard Model. In: Lotker, Z., Patt-Shamir, B. (eds) Structural Information and Communication Complexity. SIROCCO 2018. Lecture Notes in Computer Science(), vol 11085. Springer, Cham. https://doi.org/10.1007/978-3-030-01325-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-01325-7_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01324-0
Online ISBN: 978-3-030-01325-7
eBook Packages: Computer ScienceComputer Science (R0)