subgraph英文翻译_含义_读音_subgraph例句_月亮词典

subgraph

英音[ ˈsʌbɡrɑːf ] 美音[ ˈsʌbɡræf ]

子图

常用释义

词性释义

n.

[数] 子图

例句

全部
子图

For a set of connected graphs, a spanning subgraph of a graph is called an -factor if every component of is isomorphic to a member of .

给定连通图集合，对图的生成子图，如果的每个分支都同构于集合的一个元素，则被称为的-因子。

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

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

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

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

Subgraph relationships are discussed in detail and corresponding instruction set extension algorithm is proposed.

详细讨论了子图相关关系和处理方法，并提出相应的指令扩展算法。

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中的边称为链支或弦。

One of the easiest ways to do this is to create a subgraph and place both the image and the label inside the subgraph.

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

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

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

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

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

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

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

Some time ago, there is a subgraph of the past hundred home textile enterprises moved back on to the modern bedding, sells well.

前段时间，有一个家纺企业把过去的百子图重新搬到现代床品上，很畅销。

These questions are special cases of the so called forbidden subgraph problem.

这些问题都是所谓禁用子图问题的特殊情形。

Secondly, it chooses individuals with larger diversity based on subgraph strategy to construct ensemble members.

然后，利用子图方法选择部分差异性大的个体参与集成。

The forbidden subgraph characterization of graphs with cut width at most 2 is established.

解决了割宽不超过2的图的禁用子图刻画问题。

GString can also facilitate similarity subgraph search.

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

Finding a Maximum Density Subgraph.

最大密度子图。

So the approach of graph based link analysis is based on frequent subgraph searching algorithm.

因此频繁子图发现算法，是基于图的链接发现技术的基础。

Line 1 of Listing 4 defines a subgraph called cluster_jhuapl. edu.

清单4中的行1定义了名为cluster_jhuapl.edu的子图。

Study of Chemical Subgraph Isomorphism Using Genetic Algorithms

遗传算法用于化学结构图的同态研究

A sufficient condition to decide a simple graph with a complete subgraph

简单图含有完全子图的一个充分条件

Estimation and Prediction on Thermodynamical Functions of Alkanes with Novel Molecular Subgraph

用分子子图法计算烷烃热力学函数

Estimation and Prediction on Heats of Formation for Nitro Furazan Series Compounds with Novel Molecular Subgraph

用分子子图法计算硝基呋咱化合物的生成热

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

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

A Set of Novel Molecular Subgraph Index to Characterize Alkanes

表征烷烃分子结构的拓扑子图指数

On maximum number of edges in a spanning Euler Subgraph,

欧拉生成子图的极大边数，

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

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

Subcircuit Extraction Algorithm Based on Subgraph Isomorphism

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

A Simple Proof of Orthogonal Factorizations in Subgraph

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

Prediction of Enthalpy of Formation for Polynitro Compounds by Using Molecular Subgraph

分子拓扑法预估多硝基烷烃化合物的生成焓

Any graceful graph is the subgraph of another graceful graph

优美图的嵌入

On the optimal complete subgraph algorithm of the chinese postman problem

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

1·Line 1 of Listing 4 defines a subgraph called cluster_jhuapl.edu.

清单 4 中的行 1 定义了名为 cluster_jhuapl.edu 的子图。

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

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

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

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

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

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

5·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的个数。