subgraph
美 
英
例句
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.
最優(yōu)化理論中的一個有名的問題要求：用比較容易的方法來尋求具有某種特殊性質的生成子圖。
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.
實現此目的最簡便方法之一就是創(chuàng)建一個子圖，并將圖像和標簽放在子圖中。
Subgraph isomorphism is NP-Complete problem. So must avoiding subgraph isomorphism by canonical code and efficient algorithm.
因此，必須有個好的規(guī)范化編碼和有效的算法來避免子圖同構這個難題。
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.
前段時間，有一個家紡企業(yè)把過去的百子圖重新搬到現代床品上，很暢銷。
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.
因此頻繁子圖發(fā)現算法，是基于圖的鏈接發(fā)現技術的基礎。
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
遺傳算法用于化學結構圖的同態(tài)研究
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
優(yōu)美圖的嵌入
On the optimal complete subgraph algorithm of the chinese postman problem
關于中國郵遞員問題的最優(yōu)完全子圖算法
A Modified Algorithm of Subgraph Isomorphism Based on Decomposition
改進的基于分解的子圖同構算法
Survey of Frequent Subgraph Mining
頻繁子圖挖掘算法綜述
A New Parallel Algorithm for Mining Maximum Frequent Itemsets Based on Maximum Complete Subgraph
一種基于極大完全子圖的最大頻繁項集并行挖掘算法
