LATIN 2018: LATIN 2018: Theoretical Informatics pp 134-145

The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model

• Florent Becker
• Pedro Montealegre
• Ivan Rapaport
• Ioan Todinca
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10807)

Abstract

The broadcast congested clique model is a message-passing model of distributed computation where n nodes communicate with each other in synchronous rounds. The joint input to the n nodes is an undirected graph G on the same set of nodes, with each node receiving the list of its immediate neighbors in G. In each round each node sends the same message to all other nodes, depending on its own input, on the messages it has received so far, and on a public sequence of random bits. One parameter of this model is an upper bound b on the size of the messages, also known as bandwidth. In this paper we introduce another parameter to the model. We study the situation where the nodes, initially, instead of knowing their immediate neighbors, know their neighborhood up to a fixed radius r.

In this new framework we study one of the hardest problems in distributed graph algorithms, this is, the problem of detecting, in G, an induced cycle of length at most k ($$\textsc {Cycle}_{\le k}$$) and the problem of detecting in G an induced cycle of length at least k $$+$$ 1 ($$\textsc {Cycle}_{>k}$$). For $$r=1$$, we exhibit a deterministic, one-round algorithm for solving $$\textsc {Cycle}_{\le k}$$ with $$b = \mathcal {O}(n^{2/k} \log n)$$ if k is even, and $$b = \mathcal {O}(n^{2/(k-1)}\log n)$$ if k is odd. We also prove, assuming the Erdős Girth Conjecture, that this result is tight for $$k \ge 4$$, up to logarithmic factors. More precisely, if each node, instead of being able to see only its immediate neighbors, is allowed to see up to distance $$r={\lfloor k/4 \rfloor }$$, and if we also allowed randomization and multiple rounds, then the number of rounds R needed to solve $$\textsc {Cycle}_{\le k}$$ must be such that $$R\cdot b = \varOmega ( n^{2/k})$$ if k is even, and $$R\cdot b = \varOmega ( n^{2/(k-1)})$$ if k is odd.

On the other hand, we show that, if each node is allowed to see up to distance $$r={\lfloor k/2 \rfloor + 1}$$, then a polylogarithmic bandwidth is sufficient for solving $$\textsc {Cycle}_{>k}$$ with only two rounds. Nevertheless, if nodes were allowed to see up to distance $$r=\lfloor k/3 \rfloor$$, then any one-round algorithm that solves $$\textsc {Cycle}_{>k}$$ needs the bandwidth b to be at least $$\varOmega (n/\log n)$$.

Keywords

Broadcast congested clique Induced cycles Graph degeneracy

References

1. 1.
Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 459–467 (2012)Google Scholar
2. 2.
Ahn, K.J., Guha, S., McGregor, A.: Graph sketches: sparsification, spanners, and subgraphs. In: Proceedings of the 31st Symposium on Principles of Database Systems, PODS 2012, pp. 5–14 (2012)Google Scholar
3. 3.
Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp. 82–93. ACM (1980)Google Scholar
4. 4.
Arfaoui, H., Fraigniaud, P., Ilcinkas, D., Mathieu, F.: Distributedly testing cycle-freeness. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 15–28. Springer, Cham (2014). Google Scholar
5. 5.
Awerbuch, B., Goldreich, O., Vainish, R., Peleg, D.: A trade-off between information and communication in broadcast protocols. J. ACM 37(2), 238–256 (1990)
6. 6.
Becker, F., Kosowski, A., Matamala, M., Nisse, N., Rapaport, I., Suchan, K., Todinca, I.: Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distrib. Comput. 28(3), 189–200 (2015)
7. 7.
Becker, F., Matamala, M., Nisse, N., Rapaport, I., Suchan, K., Todinca, I.: Adding a referee to an interconnection network: what can(not) be computed in one round. In: Proceedings of the 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011, pp. 508–514 (2011)Google Scholar
8. 8.
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). Google Scholar
9. 9.
Birmelé, E.: Tree-width and circumference of graphs. J. Graph Theory 43(1), 24–25 (2003)
10. 10.
Bondy, J.A., Simonovits, M.: Cycles of even length in graphs. J. Comb. Theory, Ser. B 16(2), 97–105 (1974)
11. 11.
Brandstädt, A., Spinrad, J.P., et al.: Graph classes: a survey, vol. 3. Siam (1999)Google Scholar
12. 12.
Censor-Hillel, K., Kaski, P., Korhonen, J.H., Lenzen, C., Paz, A., Suomela, J.: Algebraic methods in the congested clique. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, pp. 143–152 (2015)Google Scholar
13. 13.
Chandrasekharan, N., Sitharama Iyengar, S.: NC algorithms for recognizing chordal graphs and k trees. IEEE Trans. Comput. 37(10), 1178–1183 (1988)
14. 14.
Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In: ACM Symposium on Principles of Distributed Computing, PODC 2014, pp. 367–376 (2014)Google Scholar
15. 15.
Erdős, P.: Extremal problems in graph theory. In: Theory of Graphs and its Applications. Proceedings of the Symposium, Smolenice (1964)Google Scholar
16. 16.
Guha, S., McGregor, A., Tench, D.: Vertex and hyperedge connectivity in dynamic graph streams. In: Proceedings of the 34th ACM Symposium on Principles of Database Systems, pp. 241–247. ACM (2015)Google Scholar
17. 17.
Hegeman, J.W., Pemmaraju, S.V., Sardeshmukh, V.B.: Near-constant-time distributed algorithms on a congested clique. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 514–530. Springer, Heidelberg (2014). Google Scholar
18. 18.
Holzer, S., Pinsker, N.: Approximation of distances and shortest paths in the broadcast congest clique. In: 19th International Conference on Principles of Distributed Systems, OPODIS 2015, Leibniz International Proceedings in Informatics (LIPIcs), vol. 46, pp. 1–16 (2016)Google Scholar
19. 19.
Jowhari, H., Saglam, M., Tardos, G.: Tight bounds for lp samplers, finding duplicates in streams, and related problems. In: Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, pp. 49–58 (2011)Google Scholar
20. 20.
Jurdzinski, T., Nowicki, K.: MST in O(1) rounds of the congested clique. Preprint arXiv:1707.08484 (2017)
21. 21.
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).
22. 22.
Lazebnik, F., Ustimenko, V.A., Woldar, A.J.: A new series of dense graphs of high girth. Bull. Am. Math. Soc. 32(1), 73–79 (1995)
23. 23.
Linial, N.: Locality in distributed graph algorithms. SIAM J. Com. 21(1), 193–201 (1992)
24. 24.
Montealegre, P., Todinca, I.: Brief anouncement: deterministic graph connectivity in the broadcast congested clique. In: Proceedings of the 35th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2016 (2016)Google Scholar
25. 25.
Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J. Comput. 24(6), 1259–1277 (1995)

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

• Florent Becker
• 1
• Pedro Montealegre
• 2
• Ivan Rapaport
• 3
• Ioan Todinca
• 1
1. 1.Univ. Orléans, INSA Centre Val de Loire, LIFO EA 4022OrléansFrance