| Subject | English | Russian |
| math. | graph partition | разрезание графа (говорят также "разбиение графа" sas_proz) |
| math. | graph partitioning | разбиение графа (Alex_Odeychuk) |
| math. | graph partitioning | разделение графа (The goals are to divide the graph into two subsets, known as partitions, which we want to have equal size, and to minimize the number of links between the partitions. This problem is known as graph partitioning, and the general problem is NP-hard.  dwavesys.com Alex_Odeychuk) |
| math. | graph partitioning problem | задача разбиения графа (dwavesys.com Alex_Odeychuk) |
| math. | graph partitioning problem | задача разделения графа (dwavesys.com Alex_Odeychuk) |
| Makarov. | isomorphism, automorphism partitioning, and canonical numbering can be solved in polynomial-time for molecular graphs | изоморфизм, автоморфные разбиения м каноническая нумерация для молекулярных графов могут быть решены за полиномиальное время |
| math. | quantum unconstrained binary optimization model for graph partitioning | модель квантовой бинарной оптимизации без ограничений для решения задачи разделения графа (The goals are to divide the graph into two subsets, known as partitions, which we want to have equal size, and to minimize the number of links between the partitions. This problem is known as graph partitioning, and the general problem is NP-hard. dwavesys.com Alex_Odeychuk) |