Search papers, labs, and topics across Lattice.
1
0
4
Achieving triangle-free graph coloring in $\log^{O(1)}\log n$ rounds could redefine the efficiency benchmarks for distributed algorithms in sparse graph structures.
