Search papers, labs, and topics across Lattice.
1
0
2
1
Distributed vertex coloring can now be solved in near-optimal $\tilde{O}(\log^4 \log n)$ rounds, closing the gap with the theoretical lower bound and exponentially improving performance for graphs with small maximum degree.
