Abstract
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an \(O(n^{1-2/\omega })\) round matrix multiplication algorithm, where \(\omega < 2.3728639\) is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include:
- 1.
triangle and 4-cycle counting in \(O(n^{0.158})\) rounds, improving upon the \(O(n^{1/3})\) algorithm of Dolev et al. [DISC 2012],
- 2.
a \((1 + o(1))\)-approximation of all-pairs shortest paths in \(O(n^{0.158})\) rounds, improving upon the \(\tilde{O} (n^{1/2})\)-round \((2 + o(1))\)-approximation algorithm given by Nanongkai [STOC 2014], and
- 3.
computing the girth in \(O(n^{0.158})\) rounds, which is the first non-trivial solution in this model.
In addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles.
Similar content being viewed by others
References
Agarwal, R.C., Balle, S.M., Gustavson, F.G., Joshi, M.V., Palkar, P.V.: A three-dimensional approach to parallel matrix multiplication. IBM J. Res. Dev. 39(5), 575–582 (1995). doi:10.1147/rd.395.0575
Aggarwal, A., Chandra, A.K., Snir, M.: Communication complexity of PRAMs. Theor. Comput. Sci. 71(1), 3–28 (1990). doi:10.1016/0304-3975(90)90188-N
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)
Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16(4–5), 434–449 (1996). doi:10.1007/BF01940874
Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995). doi:10.1145/210332.210337
Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209–223 (1997). doi:10.1007/BF02523189
Ballard, G., Demmel, J., Holtz, O., Lipshitz, B., Schwartz, O.: Communication-optimal parallel algorithm for Strassen’s matrix multiplication. In: Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2012), pp. 193–204. (2012a). doi:10.1145/2312005.2312044
Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Graph expansion and communication costs of fast matrix multiplication. J. ACM 59(6), 32 (2012b). doi:10.1145/2395116.2395121
Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Communication costs of Strassen’s matrix multiplication. Commun. ACM 57(2), 107–114 (2014). doi:10.1145/2556647.2556660
Björklund, A.: Determinant sums for undirected hamiltonicity. SIAM J. Comput. 43(1), 280–299 (2014). doi:10.1137/110839229
Björklund, A., Husfeldt, T.: Shortest two disjoint paths in polynomial time. In: Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), LNCS, vol. 8572, pp. 211–222. (2014). doi:10.1007/978-3-662-43948-7_18
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), pp. 67–74. (2007). doi:10.1145/1250790.1250801
Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546–563 (2009). doi:10.1137/070683933
Björklund, A., Kaski, P., Kowalik, Ł.: Probably optimal graph motifs. In: Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), LIPIcs, vol. 20, pp. 20–31. (2013). doi:10.4230/LIPIcs.STACS.2013.20
Björklund, A., Kaski, P., Kowalik, Ł.: Counting thin subgraphs via packings faster than meet-in-the-middle time. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 594–603. (2014). doi:10.1137/1.9781611973402.45
Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. In: Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), pp. 196–207. (2013). doi:10.1007/978-3-642-39206-1_17
Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Springer, Berlin (1997)
Censor-Hillel, K., Kaski, P., Korhonen, J.H., Lenzen, C., Paz, A., Suomela, J.: Algebraic methods in the congested clique. In: Proceedings of the 34nd ACM Symposium on Principles of Distributed Computing (PODC 2015), pp. 143–152. (2015). doi:10.1145/2767386.2767414
Chan, T.M.: All-pairs shortest paths with real weights in \({O}(n^3/\log n)\) time. Algorithmica 50(2), 236–243 (2008). doi:10.1007/s00453-007-9062-1
Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. SIAM J. Comput. 39(5), 2075–2089 (2010). doi:10.1137/08071990X
Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), pp. 150–159. (2011). doi:10.1109/FOCS.2011.23
Cygan, M., Kratsch, S., Nederlof, J.: Fast Hamiltonicity checking via bases of perfect matchings. In: Proceedings of the 45th ACM Symposium on Theory of Computing (STOC 2013), pp. 301–310. (2013). doi:10.1145/2488608.2488646
Czumaj, A., Lingas, A.: Finding a heaviest triangle is not harder than matrix multiplication. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 986–994. (2007)
Das Sarma, A., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. In: Proceedings of the 43th ACM Symposium on Theory of Computing (STOC 2011), pp. 363–372. (2011). doi:10.1145/1993636.1993686
Dolev, D., Lenzen, C., Peled, S.: “Tri, tri again”: finding triangles and small subgraphs in a distributed setting. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC 2012), pp. 195–209. (2012). doi:10.1007/978-3-642-33651-5_14
Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In: Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing (PODC 2014), pp. 367–376. (2014). doi:10.1145/2611462.2611493
Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. 326(1–3), 57–67 (2004). doi:10.1016/j.tcs.2004.05.009
Fischer, M.J., Meyer, A.R.: Boolean matrix multiplication and transitive closure. In: Proceedings of the 12th Symposium on Switching and Automata Theory (FOCS 1971), pp. 129–131. (1971). doi:10.1109/SWAT.1971.4
Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S., Rao, B.V.R.: Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. 78(3), 698–706 (2012). doi:10.1016/j.jcss.2011.10.001
Fomin, F.V., Lokshtanov, D., Saurabh, S.: Efficient computation of representative sets with applications in parameterized and exact algorithms. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 142–151. (2014). doi:10.1137/1.9781611973402.10
Fredman, M.L.: New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5(1), 83–89 (1976). doi:10.1137/0205006
Frischknecht, S., Holzer, S., Wattenhofer, R.: Networks cannot compute their diameter in sublinear time. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 1150–1162. (2012)
Furman, M.E.: Application of a method of fast multiplication of matrices to problem of finding graph transitive closure. Dokl. Akad. Nauk SSSR 194(3), 524 (1970)
Han, Y.: An \({O}(n^3(\log \log n/\log n)^{5/4})\) time algorithm for all pairs shortest path. Algorithmica 51(4), 428–434 (2008). doi:10.1007/s00453-007-9063-0
Han, Y., Takaoka, T.: An \({O}(n^3 \log \log n / \log ^2 n)\) time algorithm for all pairs shortest paths. In: Proceedings of the 13th Scandinavian Symposium on Algorithm Theory (SWAT 2012), pp. 131–141. (2012). doi:10.1007/978-3-642-31155-0_12
Hegeman, J.W., Pemmaraju, S.V.: Lessons from the congested clique applied to mapreduce. In: Proceedings of the 21st Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), pp. 149–164. (2014). doi:10.1007/978-3-319-09620-9_13
Hegeman, J.W., Pemmaraju, S.V., Sardeshmukh, V.B.: Near-constant-time distributed algorithms on a congested clique. In: Proceedings of the 28th International Symposium on Distributed Computing (DISC 2014), pp. 514–530. (2014). doi:10.1007/978-3-662-45174-8_35
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: Proceedings of the 34nd ACM Symposium on Principles of Distributed Computing (PODC 2015), pp. 91–100. (2015). doi:10.1145/2767386.2767434
Holzer, S., Pinsker, N.: Approximation of distances and shortest paths in the broadcast congest clique. In: Proceedings of the 19th Conference on Principles of Distributed Systems (OPODIS 2015), (2015)
Holzer, S., Wattenhofer, R.: Optimal distributed all pairs shortest paths and applications. In: Proceedings of the 31st ACM Symposium on Principles of Distributed Computing (PODC 2012), pp. 355–364. (2012). doi:10.1145/2332432.2332504
Holzer, S., Peleg, D., Roditty, L., Wattenhofer, R.: Brief announcement: distributed \(3/2\)-approximation of the diameter. In: Proceedings of the 28th International Symposium on Distributed Computing (DISC 2014), pp. 562–564. (2014)
Irony, D., Toledo, S., Tiskin, A.: Communication lower bounds for distributed-memory matrix multiplication. J. Parallel Distrib. Comput. 64(9), 1017–1026 (2004). doi:10.1016/j.jpdc.2004.03.021
Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413–423 (1978). doi:10.1137/0207033
Kerr, L.R.: The effect of algebraic structure on the computational complexity of matrix multiplications. Ph.D. thesis, Cornell University (1970)
Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008), LNCS, vol. 5125, pp. 575–586. (2008). doi:10.1007/978-3-540-70575-8_47
Kowaluk, M., Lingas, A., Lundell, E.M.: Counting and detecting small subgraphs via equations and matrix multiplication. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 1468–1476. (2011). doi:10.1137/1.9781611973082.114
Kutten, S., Peleg, D.: Fast distributed construction of small \(k\)-dominating sets and applications. J. Algorithms 28(1), 40–66 (1998). doi:10.1006/jagm.1998.0929
Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th Symposium on Symbolic and Algebraic Computation (ISSAC 2014), pp. 296–303. (2014). doi:10.1145/2608628.2608664
Lenzen, C.: Optimal deterministic routing and sorting on the congested clique. In: Proceedings of the 32nd ACM Symposium on Principles of Distributed Computing (PODC 2013), pp. 42–50. (2013). doi:10.1145/2484239.2501983
Lenzen, C., Patt-Shamir, B.: Fast routing table construction using small messages. In: Proceedings of the 45rd ACM Symposium on Theory of Computing (STOC 2013), pp. 381–390. (2013). doi:10.1145/2488608.2488656
Lenzen, C., Peleg, D.: Efficient distributed source detection with limited bandwidth. In: Proceedings of the 32nd ACM Symposium on Principles of Distributed Computing (PODC 2013), pp. 375–382. (2013). doi:10.1145/2484239.2484262
Lenzen, C., Wattenhofer, R.: Tight bounds for parallel randomized load balancing. In: Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC 2011), pp. 11–20. (2011). doi:10.1145/1993636.1993639
Lokshtanov, D., Nederlof, J.: Saving space by algebraization. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 2010), (2010). doi:10.1145/1806689.1806735
Lotker, Z., Patt-Shamir, B., Pavlov, E., Peleg, D.: Minimum-weight spanning tree construction in \(O(\log \log n)\) communication rounds. SIAM J. Comput. 35(1), 120–131 (2005). doi:10.1137/S0097539704441848
Luo, Q., Drake, J.B.: A scalable parallel Strassen’s matrix multiplication algorithm for distributed-memory computers. In: Symposium on Applied Computing (SAC), pp. 221–226. (1995). doi:10.1145/315891.315965
Matoušek, J. (ed.): Lectures on discrete geometry. Graduate Texts in Mathematics. Springer, New York (2002)
McColl, W.F.: Scalable computing. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 46–61. Springer, Berlin, Heidelberg (1995). doi:10.1007/BFb0015236
McColl, W.F.: A BSP realisation of Strassen’s algorithm. In: Kara, M., Davy, J.R., Goodeve, D., Nash, J. (eds.) Abstract Machine Models for Parallel and Distributed Computing. Concurrent Systems Engineering, vol. 48, pp. 43–46. IOS Press, Amsterdam (1996)
Munro, I.: Efficient determination of the transitive closure of a directed graph. Inf. Process. Lett. 1(2), 56–58 (1971). doi:10.1016/0020-0190(71)90006-8
Nanongkai, D.: Distributed approximation algorithms for weighted shortest paths. In: Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014), pp. 565–573, (2014)
Nešetřil, J., Poljak, S.: On the complexity of the subgraph problem. Comment. Math. Univ. Carol. 26(2), 415–419 (1985)
Patt-Shamir, B., Teplitsky, M.: The round complexity of distributed sorting. In: Proceedings of the 30th ACM Symposium on Principles of Distributed Computing (PODC 2011), pp. 249–256. (2011). doi:10.1145/1993806.1993851
Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA (2000)
Peleg, D., Rubinovich, V.: Near-tight lower bound on the time complexity of distributed MST construction. SIAM J. Comput. 30(5), 1427–1442 (2000). doi:10.1137/S0097539700369740
Peleg, D., Roditty, L., Tal, E.: Distributed algorithms for network diameter and girth. In: Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), pp. 660–672. (2012). doi:10.1007/978-3-642-31585-5_58
Raghavan, P., Thompson, C.D.: Provably good routing in graphs: regular arrays. In: Proceedings of the 7th ACM Symposium on Theory of Computing (STOC 1985), pp. 79–87. (1985)
Richards, D., Liestman, A.L.: Finding cycles of a given length. Ann. Discrete Math. 27, 249–256 (1985)
Seidel, R.: On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Syst. Sci. 51(3), 400–403 (1995). doi:10.1006/jcss.1995.1078
Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13(4), 354–356 (1969). doi:10.1007/BF02165411
Takaoka, T.: A faster algorithm for the all-pairs shortest path problem and its application. In: Proceedings of the 10th International Conference on Computing and Combinatorics (COCOON 2004), pp. 278–289. (2004). doi:10.1007/978-3-540-27798-9_31
Takaoka, T.: An \({O}(n^3 \log \log n/\log n)\) time algorithm for the all-pairs shortest path problem. Inf. Process. Lett. 96(5), 155–161 (2005). doi:10.1016/j.ipl.2005.08.008
Tiskin, A.: Bulk-synchronous parallel multiplication of boolean matrices. In: Proceedings of the 25th Colloquium on Automata, Languages and Programming (ICALP 1998), pp. 494–506. Springer Berlin, Heidelberg (1998). doi:10.1007/BFb0055078
Tiskin, A.: The design and analysis of bulk-synchronous parallel algorithms. Ph.D. thesis, University of Oxford (1999)
Vassilevska Williams, V., Williams, R.: Finding, minimizing, and counting weighted subgraphs. SIAM J. Comput. 42(3), 831–854 (2013). doi:10.1137/09076619X
Williams, R.: Finding paths of length \(k\) in \(O^*(2^k)\) time. Inf. Process. Lett. 109(6), 315–318 (2009). doi:10.1016/j.ipl.2008.11.004
Williams, R.: Faster all-pairs shortest paths via circuit complexity. In: Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014), ACM, pp. 664–673. (2014). doi:10.1145/2591796.2591811
Yuval, G.: An algorithm for finding all shortest paths using \(n^{2.81}\) infinite-precision multiplications. Inf. Process. Lett. 4(6), 155–156 (1976). doi:10.1016/0020-0190(76)90085-5
Zwick, U.: Exact and approximate distances in graphs—a survey. In: Proceedings of the 9th European Symposium on Algorithms (ESA 2001), pp. 33–48. (2001). doi:10.1007/3-540-44676-1_3
Zwick, U.: All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49(3), 289–317 (2002). doi:10.1145/567112.567114
Zwick, U.: A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. Algorithmica 46(2), 181–192 (2006). doi:10.1007/s00453-005-1199-1
Acknowledgments
We thank Keijo Heljanko, Juho Hirvonen, Fabian Kuhn, Tuomo Lempiäinen, and Joel Rybicki for discussions, and the anonymous reviewers for comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by ISF Individual Research Grant 1696/14 (K. C.-H.) and the European Research Council under the European Union’s Seventh Framework programme (FP/2007–2013) / ERC Grant Agreement n. 338077 (P. K.). This work is an extended version of a preliminary conference report [18].
Rights and permissions
About this article
Cite this article
Censor-Hillel, K., Kaski, P., Korhonen, J.H. et al. Algebraic methods in the congested clique. Distrib. Comput. 32, 461–478 (2019). https://doi.org/10.1007/s00446-016-0270-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-016-0270-2