英语释义

1. a graph all of whose points and lines are contained in a larger graph

片语

linear subgraph线性子图

encapsulation subgraph封闭子图

null subgraph空子图

right subgraph翻译

fuzzy subgraph模糊子图

critical subgraph关键子图

related subgraph相关子图

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

  实现此目的最简便方法之一就是创建一个子图，并将图像和标签放在子图中。

• The paper studies circuit design subgraph search algorithm and puts forward a new search algorithm that bases on circuit character.

  本文研究和分析了电路设计子图搜索算法的设计思路，提出了一种新的基于电路特征分析的电路设计子图搜索算法。

• With the increasing demand of massive structured data analysis, mining frequent subgraph patterns from graph datasets has been an attention-deserving field.

  随着对大量结构化数据分析需求的增长，从图集合中挖掘频繁子图模式已经成为数据挖掘领域的研究热点。

• 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上的三类概率测度，它们分别刻画图的随机扩张树，随机扩张森林和随机连通子图。

• Usually this occurs because a subgraph concerns a related set of functionality.

  通常这个发生的原因是子图涉及到相关的一套功能。

• In this paper we introduce a problem of discovering frequent subgraph with flexible time constraints.

  中文摘要在本篇论文中我们提出探勘具时间限制的频繁子图问题。

• The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.

  最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。

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

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

• 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．并且，这一结果是最佳可能的。

• This system adopts open subgraph bank and the drawing, data management, analysis and calculation can be all completed on same operating platform.

  系统采用开放式子图库，使绘图，数据管理，分析计算均在同一操作平台下完成。

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

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

• 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的完美匹配。

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

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

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

  该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。

• Then, the algorithm is extended to process subgraph queries in form of bipartite graphs.

  然后，该算法被扩展来处理特殊的二分图查询。

• Frequent subgraph mining includes subgraph search and isomorphism problems.

  频繁子图挖掘主要涉及到子图搜索和子图同构问题。

• First of all, original image is divided into blocks, each subgraph for integer wavelet decomposition, and then the binary image after scrambling embedding.

  首先将原始图像进行分块，逐一对每块子图进行整数小波分解，然后将置乱后的二值图像嵌入到低频系数。

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

  采用分子子图编码法将烷烃的分子子图码作为人工神经网络的输入参数 ，对烷烃的吉布斯自由能进行预测 。