Elaborating upon the matrix multiplication algorithms is beyond the scope of this survey. Yet, we must mention a crucial component that underlies these \(\mathsf {CLIQUE}\)  algorithms, as well as numerous additional \(\mathsf {CLIQUE}\)  algorithms for various tasks, which is the ingenious routing technique of Lenzen [1]}. In a nutshell, this technique provides a way to route in \(O(1)\)  rounds any set of messages in which each node needs to send and receive at most \(n\)  messages.
