subgraph
n.
子图；
权威例句
Frequent Subgraph DiscoveryFrequent subgraph discovery
Subgraph centrality in complex networks
An Algorithm for Subgraph Isomorphism
An Algorithm for Subgraph Isomorphism
The Directed Subgraph Homeomorphism Problem.
A graph distance metric based on the maximal common subgraph
A virtual network mapping algorithm based on subgraph isomorphism detection
On a relation between graph edit distance and maximum common subgraph
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
1. Line 1 of Listing 4 defines a subgraph called cluster_jhuapl.edu.
清单4中的行1定义了名为 cluster_jhuapl.edu 的子图。
youdao
2. A graph G is supereulerian if G has a spanning eulerian subgraph.
若图G含有生成欧拉子图，则称G是超欧拉的。
youdao
3. Frequent subgraph mining includes subgraph search and isomorphism problems.
频繁子图挖掘主要涉及到子图搜索和子图同构问题。
youdao
4. Usually this occurs because a subgraph concerns a related set of functionality.
通常这个发生的原因是子图涉及到相关的一套功能。
youdao
5. Then, the algorithm is extended to process subgraph queries in form of bipartite graphs.
然后，该算法被扩展来处理特殊的二分图查询。
youdao
6. In this paper we introduce a problem of discovering frequent subgraph with flexible time constraints.
中文摘要在本篇论文中我们提出探勘具时间限制的频繁子图问题。
youdao
7. One of the easiest ways to do this is to create a subgraph and place both the image and the label inside the subgraph.
实现此目的最简便方法之一就是创建一个子图，并将图像和标签放在子图中。
youdao
8. In this new similarity measure, main structure of the graph is first measured according to the topological common subgraph.
鉴于这种情况，将最大拓扑公共子图法与编辑距离测量法相结合，提出了一种新的相似性测量方法。
youdao
9. A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property.
最优化理论中的一个有名的问题要求：用比较容易的方法来寻求具有某种特殊性质的生成子图。
youdao
10. The paper studies circuit design subgraph search algorithm and puts forward a new search algorithm that bases on circuit character.
本文研究和分析了电路设计子图搜索算法的设计思路，提出了一种新的基于电路特征分析的电路设计子图搜索算法。
youdao
11. The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。
youdao
12. This system adopts open subgraph bank and the drawing, data management, analysis and calculation can be all completed on same operating platform.
系统采用开放式子图库，使绘图，数据管理，分析计算均在同一操作平台下完成。
youdao
13. 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.
剩下要做的事只是用适当的子图代替这个图解的每条边，使得原来用方向和颜色给出的信息由这个子图来担当。
youdao
14. First of all, original image is divided into blocks, each subgraph for integer wavelet decomposition, and then the binary image after scrambling embedding.
首先将原始图像进行分块，逐一对每块子图进行整数小波分解，然后将置乱后的二值图像嵌入到低频系数。
youdao
15. With the increasing demand of massive structured data analysis, mining frequent subgraph patterns from graph datasets has been an attention-deserving field.
随着对大量结构化数据分析需求的增长，从图集合中挖掘频繁子图模式已经成为数据挖掘领域的研究热点。
youdao
16. G is said to be bipartite matching extendable (BM-extendable) if every matching m whose induced subgraph is a bipartite graph extends to a perfect matching of g.
称g是偶匹配可扩的，如果G中导出子图是偶图的匹配m都可以扩充为g的完美匹配。
youdao
17. On the basis of molecular subgraph coding method, a back propagation neural network was trained on the molecular subgraph code to predict Gibbs energy of alkanes.
采用分子子图编码法将烷烃的分子子图码作为人工神经网络的输入参数 ，对烷烃的吉布斯自由能进行预测 。
youdao
18. This algorithm firstly searches for the central node of the query keywords, and then searches for the keyword nodes through this central node to construct the subgraph.
该算法首先搜索得到与所有查询关键字相关的中心节点，再通过中心节点搜索连接成子图。
youdao
19. In this paper we proved that every near triangulation without separating triangles has a 2-connected spanning subgraph of maximum degree at most 3 which is the best possible.
证明了每一个无可分离三角形的几乎三角剖分图均存在一个2-连通支撑子图，其最大度至多3．并且，这一结果是最佳可能的。
youdao
20. The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.
该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。
youdao
21. This algorithm firstly searches for the matching keyword nodes of the query keywords, and then Bridges these keyword nodes through the central node of them to construct the subgraph.
该算法首先搜索得到与查询关键字匹配的关键字节点，再由这些关键字节点的中心节点将它们连接成子图。
youdao
22. In the paper, we prove that the edge number of the Subgraph with maximal edge number of cube graph is equal to the number of 1 in (0,1)-string all integers between 1 and its verter number.
本文中，我们证明了立方图的极大边数子图的边数等于从1到它的点数之间所有正整数的（0，1）——串表示中1的个数。
youdao
23. We consider three types of probability measures on Q, the set of subgraphs of g, which govern a random spanning tree, a random spanning forest, and a random connected subgraph respectively.
本文研究图g的子图空间g上的三类概率测度，它们分别刻画图的随机扩张树，随机扩张森林和随机连通子图。
youdao
24. The paper briefly introduces some graph theory methods such as maximal connected subgraph, maximal cliques, perfect match and graph spectral research which applied in prediction of protein structure.
该文简要介绍图的连通子图、图的最大团、图的完美匹配及图谱法在蛋白质结构预测中的应用。
youdao
25. This paper shows that the traditional parallelization techniques can be used to exploit subword parallelism, and also proposes a novel method to extract subword parallelism based on the cost subgraph.
本文说明传统的并行技术可以有效地开发循环中的子字并行性，同时提出一种基于代价子图的子字并行指令自动识别的方法。
youdao
26. This paper shows that the traditional parallelization techniques can be used to exploit subword parallelism, and also proposes a novel method to extract subword parallelism based on the cost subgraph.
本文说明传统的并行技术可以有效地开发循环中的子字并行性，同时提出一种基于代价子图的子字并行指令自动识别的方法。
youdao
subgraph
