In Chapter 4, we consider the 2-catalog Segmentation problem which is equivalent to some kind of bipartite graph partition problem.

在第四章，我们研究二目录分割问题，它等价于一个基于二部图上的某种划分问题。

youdao

There is an issue of A/B plane partition of HSTPs in the topology optimization of CCS7 network. It can be formulated into a new kind of graph partition problem.

七号信令网拓扑优化中存在高级信令转接点（HSTP）的A/B平面划分问题，其可归纳为一类新的图的划分问题。

youdao

The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.

将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。

youdao

The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.

将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。

youdao