subgraph

subgraph

1. GString can also facilitate similarity subgraph search.

GString也能很方便地支持相似子图搜索问题。

2. GString is a subgraph search algorithm designed for chemical compound structure database.

GString是针对化学化合物分子结构数据库进行子图搜索的算法。

3. Hamilton subgraph

Hamilton子图

4. "DOUBLE" SUBGRAPH ISOMORPHISM METHOD FOR MATCHING LSI CHIP IMAGES

LSI芯片图象的双子图同构匹配法

5. R-Degree integral subgraph of q-trees

q-树的r次整子图

6. complete subgraph

[计] 完全子图

7. maximal common subgraph

[计] 最大公用子图形

8. α - subgraph

α-子图

9. A New Parallel Algorithm for Mining Maximum Frequent Itemsets Based on Maximum Complete Subgraph

一种基于极大完全子图的最大频繁项集并行挖掘算法

10. A class of undirected graph G= abstracted from practical problems whose vertices and edges have varied weight,a clique of graph G is maximum complete subgraph in G.

一类由实际问题抽象出来的点边具有变权值的无向图G=,图G的团是G中的极大完全子图。

11. dissimilar subgraph

不同类子图

12. Upper Bound Of The Maximum Possible Numbers OF Edges In A Simple Graph Containing no 3-Regular Subgraph

不含3正则子图之简单图的最大可能边数的一个上界

13. Tow Maximal Planar Graphs with Path Bichromatic Subgraph Only

两个只有路型二色子图的极大平面图

14. skeleton subgraph

主干子图

15. bipartite subgraph problem

二分图问题

16. bichromatic subgraph

二色子图

17. bipartite subgraph

二部子图

18. Keywords artificial neural network;molecular subgraph;alkanes;thermodynamic properties;

人工神经网络;分子子图;烷烃;热力学性质;

19. All conceptions, including Content DataModel (CDM), Data Dependency Graph (DDG) and Data Update Subgraph (DUS)are defined.

以GUI抽象描述模型为基础,本文提出了GUI内容数据的建模方法。 通过定义数据依赖图和数据更新子图记录和表现数据间的依赖关系和变化。

20. Another problem is previous frequent subgraph mining algorithms treat graphs uniformly while graphs have different importance actually.

传统的频繁子图挖掘方法对满足最小支持度阈值的子图同等对待，但在真实数据库中不同的子图往往具有不同的重要程度。

21. All you need to do is create your text in a subgraph.

你所要做的是将你的文字创建在一个子图中。

22. even subgraph

偶子图

23. On the optimal complete subgraph algorithm of the chinese postman problem

关于中国邮递员问题的最优完全子图算法

24. ADVANCES ON THE RESEARCH ABOUT ASCENDING SUBGRAPH DECOMPOSITION

关于图的升分解研究的进展

25. A Simple Proof of Orthogonal Factorizations in Subgraph

关于存在子图有正交因子分解的一个简单证明

26. critical subgraph

关键子图

27. Secondly，weighted maximal frequent subgraph is defined，which can not only discover important maximal subgraph，but also inherit the property of anti-monotony.Thus，the speed of pruning is quickened.

其次，给出了加权最大频繁子图的定义，不仅可以找出较为重要的最大频繁子图，而且可以使挖掘结果同样具有反单调性，从而可加速剪枝。

28. molecular subgraph

分子子图

29. Keywords molecular subgraph;QSPR alkanes;thermodynamical function;

分子子图;QSPR;烷烃;热力学函数;

30. Keywords Molecular subgraph;QSPR;Nitro furazan compounds;Heats of formation;

分子子图;QSPR;硝基呋咱;生成热;

31. Partition,Subgraph,Degree sum,Maximum degree,Bipartite graph,Vertex-disjoint,Cycles,Paths.

剖分,子图,度和,最大度,二部图,顶点不交,圈,路.

32. It only remains to replace each edge of this diagram by a suitable subgraph which bears the information previously given by the direction and colour.

剩下要做的事只是用适当的子图代替这个图解的每条边，使得原来用方向和颜色给出的信息由这个子图来担当。

33. right subgraph

右子图

34. Graph query searches the database and identifies all subgraph occurrences of a given query graph.

回答该查询问题通常可以分为两个阶段，即查询过滤阶段与查询验证阶段。

35. Subgraph isomorphism is NP-Complete problem.So must avoiding subgrph isomorphism by canonical code and efficient algorithm.

因此，必须有个好的规范化编码和有效的算法来避免子图同构这个难题。

36. Keywords graph;connected graph;subgraph;algorithm;molecular structure;

图;连通图;子图;算法;分子结构;

37. maximal connected subgraph

图的连通子图

38. Let brk(Kt,t) be the minimum integer such that in any edge coloring of Kn,nwith K colors there is a monochromatic Kt,t,and let Z(n,t) be the maximum number of edges in a subgraph Kn,n of that contains no Kt,t.

在对完全二部图Kn,n进行k-边着色中,记brk(Kt,t)为能够诱导出单色Kt,t的最小的正整数n,另外,记z(n;t)为Kn,n中不含子图Kt,t最大的边数。

39. Finally, we repeat the above phases until no more dense subgraph can be found.

在最后一个步骤，我们重复第一到第三步骤直到我们找不出任何密集的子网路为止。

40. Graphplan algorithm involves two interleaved stages? expansion of the "planning graph" data structure,and a backward search on the planning graph to see if any subgraph of it corresponds to a validsolution for the given problem.

在确定性planning问题中，graphplan方法具有明显的优势。 Graphplan在类似STRIPS的确定性论域中进行规划。

41. Second, we find a dense subgraph based on the greedy algorithm.

在第二个步骤，我们利用贪婪演算法找到一个密集的子网路；

42. Subcircuit Extraction Algorithm Based on Subgraph Isomorphism

基于子图同构的子电路提取算法

43. If T is a subgraph of a graph G, then the edges of G not included in T are called links or chords.

如果T是图g的一个子图，则g珠不包含在T中的边称为链支或弦。

44. subgraph isomrphism

子图同构

45. subgraph isomorphism

子图同构性

46. Extracting of wordNet subgraph

子图抽取

47. subgraph mining

子图挖掘

48. Experiments show that the approach is applicability and can find un-matched connected subgraph.

实践证明，所提方法能够完成工厂设计模型的数据匹配，并能判断出不匹配的连通子图。

49. 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.

对于给定的查询，我们使用这些索引过滤图数据库，得到较小的候选集，减少需要进行的高时间复杂度的子图同构匹配。

50. dual bi-chromatic subgraph

对偶二色子图

51. A method to find maximum number of edges in a spanning Eulerian subgraph

寻找欧拉生成子图最大边数的一个方法

52. derived subgraph

导出子图

53. After the circuit is abstracted as a directed graph, circuits matching problem is solved by subgraph isomorphism algorithm.

将电路抽象成有向图的数学模型后，采用了子图同构算法实现电路匹配。

54. Although Subgraph Isomorphism problem is known to be NP-complete,our solution is very fast in practice for real circuits.

尽管子图同构问题是NP完全问题,算法对实际的电路是快速的,满足工程需要。

55. survival subgraph

幸存子图

56. strongly closed subgraph

强闭包子图

57. We call such a spanning subgraph T an economical spanning subgraph.

我们称这样的生成子图T为廉价的生成子图。

58. topological common subgraph

拓扑公共子图

59. Frequent subgraph mining is an active research topic in the data mining community.

摘要 如何从大量的图中挖掘出令人感兴趣的子图模式已经成为数据挖掘领域研究的热点之一。

60. In this paper, the 3-regular simple planar graphs with diameter 3 are completely characterized, and by discussion of the subgraph and girth all of 11 non-isomorphic graphs are obtained.

摘要通过对子图和围长的研究，完全刻画了直径为3的3-正则简单平面图，获得了这类图仅有的11个非同构图。

61. shrinking subgraph

收缩子图

62. A Modified Algorithm of Subgraph Isomorphism Based on Decomposition

改进的基于分解的子图同构算法

63. A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property.

最优化理论中的一个有名的问题要求：用比较容易的方法来寻求具有某种特殊性质的生成子图。

64. The Length of the Largest Induced 2-Regular Subgraph in Graphs

最大2-正则诱导子图的长度

65. weighted maximal frequent subgraph

最大加权频繁子图

66. Finding a Maximum Density Subgraph.

最大密度子图。

67. maximal frequent subgraph

最大频繁子图

68. directed subgraph

有向子图

69. In this paper, a uniform character, i.e. the above subgraph is disconnected, is given to recognize essentially disconnected polyhexe graph.

本文主要给出关于本质不连通多六隅图的一个统一的结构特征：删除本质不连通多六隅图图的固定键后所得的子图是不连通的。

70. A flow graph matching algorithm has been implemented on the Connection Machine which employs parallel techniques to allow efficient subgraph matching.

本文乃是对生物膜反应器之废水处理进行模拟，以期能在废水处理上得到较佳的数学模式。

71. The contribution of this paper includes: Firstly, a measurement model has been proposed by researching the search space of subgraph isomorphism algorithm.

本文从基本的子图匹配算法入手，继而研究了其搜索空间，并给出了形式化的度量模型。

72. We propose the definition of approximate acceptance with which we discuss the nonuniform complexity of the K sized complete subgraph problem.

本文提出逼近接受的概念,用来讨论K-团问题的非一致复杂性。

73. Dengxin Li, Deying Li, Jingzhong Mao, On maximum number of edges in a spanning eulerian subgraph, Discrete Mathematics 272(2004) 299-302.

李霄民，李登信，探索极大欧拉生成子图的一种方法，工程数学学报，21（2004）1018-1020

74. maximum complete subgraph

极大完全子图

75. A Necessary Condition of Bichromatic Tree Subgraph in Maximal Planner Graph

极大平面图中二色树子图的一个必要条件

76. Some theorems about the number of edges of maximum spanning Elerian subgraph

极大欧拉生成子图边数的几个定理

77. nuclear subgraph

核子图

78. According to the characteristics of telecom data，an algorithm（MCSG） of searching maximal connected subgraph was proposed based on relational database.

根据电信数据的特点，以关系数据库为基础，实现了一个极大连通子图求解算法（MCSG）。

79. fuzzy subgraph

模糊子图

80. maximum spanning eulerian subgraph

欧拉生成子图