Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model

21 Jan 2020 Izumi Taisuke Gall François Le Magniez Frédéric

This paper considers the triangle finding problem in the CONGEST model of distributed computing. Recent works by Izumi and Le Gall (PODC'17), Chang, Pettie and Zhang (SODA'19) and Chang and Saranurak (PODC'19) have successively reduced the classical round complexity of triangle finding (as well as triangle listing) from the trivial upper bound $O(n)$ to $\tilde O(n^{1/3})$, where~$n$ denotes the number of vertices in the graph... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • QUANTUM PHYSICS
  • DISTRIBUTED, PARALLEL, AND CLUSTER COMPUTING