更改

Partitioning the graph needs to be done carefully - there is a trade-off between low communication and even size partitioning But partitioning a graph is a NP-hard problem, so it is not feasible to calculate them. Instead, the following heuristics are used.

Partitioning the graph needs to be done carefully - there is a trade-off between low communication and even size partitioning But partitioning a graph is a NP-hard problem, so it is not feasible to calculate them. Instead, the following heuristics are used.

图的划分需要仔细地进行——在低通信和大小划分之间有一个权衡。但是图的划分是一个'''<font color="#ff8000"><big>NP</big>难问题 NP-Hard Problem</font>，因此计算它们是不可行的。相反，使用以下启发式。

图的划分需要仔细地进行——在低效率连接和大小划分之间有一个权衡。但是图的划分是一个'''<font color="#ff8000"><big>NP</big>艰难的问题 NP-Hard Problem</font>，因此计算它们是不可行的。但是，我们可以使用以下启发式。