1) subgraph isomorphism
子图同构
1.
Similarity acquisition of function-structure feature template for configurable products based on subgraph isomorphism
基于子图同构的可配置产品功能结构特征模板相似性获取
2.
The algorithm transforms the subgraph isomorphism problem into a matching problem between vertexes through the introduction of similarity features for every vertex.
提出一种基于子图同构的高性能辐射路匹配算法,以满足反向分析中逻辑综合的需要。
3.
A new approach to local matching of CAD models based on subgraph isomorphism is presented.
针对整体相似性检索算法无法实施精确的局部结构匹配的问题,提出一种基于子图同构的三维CAD模型局部结构匹配算法。
2) decomposition of graphs
图的同构因子
3) composition of graphs
图的同构因子分解
4) graph isomorphism
图同构
1.
Base on this approach, the similarity of process plan instances of different parts can be evaluated by the subgraph isomorphism method, after that, a filter function is performed to scale down the instance set, then the user can select instance from it to start his process plan design.
提出一个以无向特征依赖图 (UFDG)表达零件特征和存储特征间的相互依赖的拓扑关系 ,通过 UFDG(子 )图同构判别零件之间的相似性、通过零件的其它特征参数的相似性选择进一步筛选工艺实例的匹配方法 。
2.
This vertex refinement method can be used in graph isomorphism algorithms to reduce the number of mapping between the vertexes.
基于路径数的顶点分类方法可以有效地用于图同构算法,能够降低所需比较的顶点数,达到快速搜索的效果。
3.
For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.
对于极小不可满足公式的子类MAX和MARG,我们证明了:其变元改名和文字改名的复杂性等价于图同构问题GI。
6) hypergraph isomorphism
超图同构
1.
By applying permutation group theory,the concepts of hyperedge group, hypergraph group and hypergraph isomorphism are introduced, and the general expressions of hyperedge group and its cycle index are derived.
应用置换群理论，引入了超过群、超围群和超图同构的概念，导出了超过群及其循环指标的一般表达式。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条