graph partition model 图分割模型
graph-partition 图划分
graph partition problem 图划分问题
parallel graph partition 并行图划分
incremental graph partition 增量划分图
Multilevel graph partition algorithm 多级图划分算法
Then, we abstract the communities in adjacent complex networks and their overlapping relationship as bi-graphs and reduce the evolutions of communities in adjacent static complex networks into a bi-graph partition problem.
然后,将相邻时刻静态社区及其成员间的重叠关系抽象为一个二分图,将动态社区演化问题抽象为二分图划分问题。
参考来源 - 时间序列中的知识发现·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
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.
将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。
应用推荐