Locality of Not-so-Weak Coloring

SIROCCO（2019）

引用 4|浏览0

暂无评分

摘要

“Easy”: solvable in \(O(\log ^* n)\) rounds with both deterministic and randomized distributed algorithms.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要