In Chapter 4, we consider the 2-catalog Segmentation problem which is equivalent to some kind of bipartite graph partition problem.
在第四章，我们研究二目录分割问题，它等价于一个基于二部图上的某种划分问题。
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平面划分问题，其可归纳为一类新的图的划分问题。
The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.
将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。
The ontologies are represented in Directed Acyclic graph (DAG) structures by preprocessing. So, the ontology partition question is changed into a graph partition question.
对本体进行预处理，把本体表示为有向无环图，将本体分块问题转换为图分割问题。
Experiments show that the new optimized partition algorithm can improve the parallel simulation performance compared with the ones partitioned by traditional graph partition algorithms.
实验表明，该优化划分方法相对于传统的图划分算法能够有效地提高模拟性能。
Bye formula and the algorithm, we can partition a graph of LSI element into a group of minimum exposure element, to advance exposure efficiency and lithophotography quality.
由此可分割LSI单元图形成最少曝光单元，以提高曝光效率和版图光刻质量。
We will use the concept of a data hierarchy graph, constructed by means of transaction analysis, to characterize the relationship between a database partition scheme and database transactions.
我们会通过处理分析的方式，使用数据层次图的概念，以描述数据库分区结构和数据库处理的关系。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
The paper presents a program structure partition method based on the program dependence graph, i. e. Program Block Partition Method, which eases the testing process.
本文提出了一种基于程序依赖图的程序结构划分的测试方法，即程序块划分法。
CDFG (control data flow graph) can be used in system modeling, software and hardware partition, synthesis and verification.
控制数据流图可用于系统建模、软硬件功能划分、系统综合与验证等多个环节。
A recursive spectral bisection method is applied to partition non-structured triangular meshes in parallel CFD for the treatment of load balance and minimum cut graph bisection.
将递归谱对剖分方法应用于流体力学并行计算中的非结构网格分割，以解决负载平衡和最小切割问题。
A recursive spectral bisection method is applied to partition non-structured triangular meshes in parallel CFD for the treatment of load balance and minimum cut graph bisection.
将递归谱对剖分方法应用于流体力学并行计算中的非结构网格分割，以解决负载平衡和最小切割问题。
应用推荐