您要查找的是不是：
- Although Subgraph Isomorphism problem is known to be NP-complete,our solution is very fast in practice for real circuits. 尽管子图同构问题是NP完全问题,算法对实际的电路是快速的,满足工程需要。
- After the circuit is abstracted as a directed graph, circuits matching problem is solved by subgraph isomorphism algorithm. 将电路抽象成有向图的数学模型后，采用了子图同构算法实现电路匹配。
- Subgraph isomorphism is NP-Complete problem.So must avoiding subgrph isomorphism by canonical code and efficient algorithm. 因此，必须有个好的规范化编码和有效的算法来避免子图同构这个难题。
- The algorithm transforms the subgraph isomorphism problem into a matching problem between vertexes through the introduction of similarity features for every vertex. 通过单个顶点的相似度特征，将子图同构问题转化为顶点之间的匹配问题。
- The contribution of this paper includes: Firstly, a measurement model has been proposed by researching the search space of subgraph isomorphism algorithm. 本文从基本的子图匹配算法入手，继而研究了其搜索空间，并给出了形式化的度量模型。
- For a given query, we filter the whole graph through the index to get a smaller candidate set.Thus, high time-complexity subgraph isomorphism matching operations are reduced. 对于给定的查询，我们使用这些索引过滤图数据库，得到较小的候选集，减少需要进行的高时间复杂度的子图同构匹配。
- A Modified Algorithm of Subgraph Isomorphism Based on Decomposition 改进的基于分解的子图同构算法
- Study of Chemical Subgraph Isomorphism Using Genetic Algorithms 遗传算法用于化学结构图的同态研究
- Subcircuit Extraction Algorithm Based on Subgraph Isomorphism 基于子图同构的子电路提取算法
- "DOUBLE" SUBGRAPH ISOMORPHISM METHOD FOR MATCHING LSI CHIP IMAGES LSI芯片图象的双子图同构匹配法
- Given a (directed ) graph H, a (directed) graph G is ak-edge fault-tolerantgraph with respect to H, denoted k-EFT (H)graph, if G contains a spanning subgraph isomorphic to H after theremoval of any k edges from G. 给定一个（有向）图H，称（有向）图G为关于H的k-边容错图，记为k－EHT（H）图，若从G中移去任何k条边所得的每个图都含有生成子图同构于H。
- subgraph isomorphism 子图同构性
- Finding a Maximum Density Subgraph. 最大密度子图。
- We call such a spanning subgraph T an economical spanning subgraph. 我们称这样的生成子图T为廉价的生成子图。
- Up to isomorphism, there is just one complete graph on vertices. 在同构意义下，几个顶点的完全图只有一个。
- Second, we find a dense subgraph based on the greedy algorithm. 在第二个步骤，我们利用贪婪演算法找到一个密集的子网路；
- Isomorphism between crystalline forms of two dimorphic substances. 同二晶现象两种双晶物质的晶体形式的同形性
- GString can also facilitate similarity subgraph search. GString也能很方便地支持相似子图搜索问题。
- All you need to do is create your text in a subgraph. 你所要做的是将你的文字创建在一个子图中。
- In silicate minerals and magnetites existed isomorph tin. 硅酸盐矿物和磁铁矿中都存在类质同象态锡。
