加载中…
2019-12-30
A Note on the Parallel Cleaning of Cliques
Alejandro Angeli AyelloMargaret-Ellen Messinger
文献摘要
We disprove a conjecture proposed in [Gaspers et al., Discrete Applied Mathematics, 2010] and provide a new upper bound for the minimum number of brushes required to continually parallel clean a clique.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本