将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。
The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.
接着把这一特殊的指派问题用有向无回路图表示出来，从而使指派问题的求解转化为求解有向无回路图的划分问题。
Then the assignment problem is illustrated with the directed acyclic graphs. The assignment problem becomes the partition problem of directed acyclic graphs.
再次，由于该社区挖掘技术能够解决以往社区边界模糊的问题，使得所挖掘的社区唯一，所以可以把该技术应用到图的划分问题上。
Thirdly, because the Web community mining technology can overcome the ambiguous boundary problem and make the community mined unique, the technology can be applied into the partitioning of the graph.
应用推荐