subgraph
英
美
网络 子图; 子图表; 子图形
双语例句
- One of the easiest ways to do this is to create a subgraph and place both the image and the label inside the subgraph.
实现此目的最简便方法之一就是创建一个子图，并将图像和标签放在子图中。 - These questions are special cases of the so called forbidden subgraph problem.
这些问题都是所谓禁用子图问题的特殊情形。 - Finding λ Edge-connected Subgraph of a Traversal Search Algorithms
寻找λ-边连通子图的一次遍历搜索算法 - Efficient Subgraph Query Processing Algorithms on Graph-Structured XML Documents
图结构XML文档上子图查询的高效处理算法 - We call such a spanning subgraph T an economical spanning subgraph.
我们称这样的生成子图T为廉价的生成子图。 - G is said to be bipartite matching extendable if every matching M whose induced subgraph is a bipartite matching extends to a perfect matching.
称图G是偶匹配可扩的，是指G的每一个偶匹配都可以扩充成为G的一个完美匹配。 - 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上的三类概率测度，它们分别刻画图的随机扩张树，随机扩张森林和随机连通子图。 - Block Division in RTDS System Based on Subgraph Isomorphism
基于子图同构算法的实时数字仿真系统模块划分 - 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中的边称为链支或弦。 - Upper Bound Of The Maximum Possible Numbers OF Edges In A Simple Graph Containing no 3-Regular Subgraph
不含3正则子图之简单图的最大可能边数的一个上界 - Frequent Subgraph Mining Based on Partially Labeled Graph
基于部分标记图的频繁子图挖掘算法研究 - Similarity acquisition of function-structure feature template for configurable products based on subgraph isomorphism
基于子图同构的可配置产品功能结构特征模板相似性获取 - Comparison and Analysis of Two Typical Frequent Subgraph Mining Algorithms
两个经典频繁子图挖掘算法的对比与分析 - 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.
本文说明传统的并行技术可以有效地开发循环中的子字并行性，同时提出一种基于代价子图的子字并行指令自动识别的方法。 - In this new similarity measure, main structure of the graph is first measured according to the topological common subgraph.
鉴于这种情况，将最大拓扑公共子图法与编辑距离测量法相结合，提出了一种新的相似性测量方法。 - This paper studies uncertain graph data mining and especially investigates the problem of mining frequent subgraph patterns from uncertain graph data.
研究不确定图数据的挖掘，主要解决不确定图数据的频繁子图模式挖掘问题。 - First of all, original image is divided into blocks, each subgraph for integer wavelet decomposition, and then the binary image after scrambling embedding.
首先将原始图像进行分块，逐一对每块子图进行整数小波分解，然后将置乱后的二值图像嵌入到低频系数。 - SUBGRAPHS WITH ( g, f)-FACTORIZATIONS ORTHOGONAL TO A SUBGRAPH IN GRAPHS; Study of Reducing Boolean Expression with Random Variables
具有与任意图正交的（g，f）-因子分解的子图任意变量逻辑函数的卡诺图化简探索 - The forbidden subgraph problem is a prime example of the rather large family of extremal problems is graph theory.
禁向子图问题是图论中相当大的一类极值问题中的主要例子。 - 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.
剩下要做的事只是用适当的子图代替这个图解的每条边，使得原来用方向和颜色给出的信息由这个子图来担当。 - The induced spanning subgraph was employed in studying the property of the graph of decomposable tensor.
应用诱导生成子图的方法，研究了可合张量的图论性质。 - A k-regular spanning subgraph of graph G is called a k-factor of G.
图G的一个k正则支撑子图称为G的k因子。 - The study of subgraph cover problems is an active and important subject in graph theory.
子图覆盖问题是一个活跃且重要的研究课题，偶子图覆盖是子图覆盖的一个重要研究方向（习惯上，我们也称偶子图为圈）。 - A routing principle into the subgraph routing method;
在子网路由法中引入了选路原则。 - A graph G with a perfect matching is elementary if its allowed lines form a connected subgraph.
一个具有完美匹配的图G是基本的，如果由它的容许边所导出的子图是连通的。 - Starting from the the chromatic polynomial of a graph, the author obtains some of its subgraph enumeration algorithms.
从图的色多项式出发，我们得到了图的某些子图计数算法。 - Layer-Decomposition and Subgraph Recognition Problems
层分解和子图识别问题 - So the approach of graph based link analysis is based on frequent subgraph searching algorithm.
因此频繁子图发现算法，是基于图的链接发现技术的基础。 - Therefore, research on the frequent subgraph mining has the important significance of theory and the application value.
因此，对频繁子图的挖掘算法的研究有着重要的理论意义和应用价值。 - Being a bottleneck problem of graphical data mining, subgraph isomorphism is considered as the root of all complexities.
子图同构问题是图数据挖掘的瓶颈问题，是造成问题复杂的根源所在。