In Chapter 4, we consider the 2-catalog Segmentation problem which is equivalent to some kind of bipartite graphpartition problem.
在第四章，我们研究二目录分割问题，它等价于一个基于二部图上的某种划分问题。
2
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 graphpartition problem.
The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graphpartition problem.