“逐个”
用英语怎么说？

In 2015, Ken-ichi Kawarabayashi and Mikkel Thorup decided to revisit the problem. They aimed to find a collection of configurations that could be reduced in parallel rather than one by one. To achieve this, they shifted their focus to flat areas of graphs where each point connects to six neighbors. Although these regions usually lack useful structures, they appear frequently across large graphs. With the help of two graduate students and extensive computing power, the team identified a massive set of 8,202 configurations. By handling multiple configurations simultaneously, their algorithm achieved a significant improvement in calculation speed, completing the coloring process in vastly fewer steps.

2015年，河原林健一与米克尔·索鲁普决定重新审视这个问题。他们的目标是找到一组可以并行约简而不是逐个约简的构型。为了实现这一目标，他们将注意力转移到图中每个点都与六个相邻点相连的平坦区域。尽管这些区域通常缺乏有用的结构，但它们在大型图中频繁出现。在两名研究生的大力协助以及大量计算资源的支持下，该团队确定了一个包含8202种构型的庞大集合。通过同时处理多种构型，他们的算法在计算速度上取得了显著改进，用少得多的步骤完成了着色过程。