查询词典 area graph

Let G be a simple graph. A line of graph G is allowed if it lies in some perfect matching of G.

设G为一个简单图。G的一条边为容许边，如果它属于G的某个完善匹配。

The paper summerizes several general pratical new techniques, such as the analyzers of program profiles, maximum potential parallelism, array privatizability, loop parallelism; the visualizers of the statement data dependence graph, procedural callgraph, loop iteration space graph and interactive tools of array privatization and unimodular transformation; the automatic techniques of array privatization combined data dependence and coverage, the computation of parallelizing unimodular transforming matrix for mult-nested loops, enhanced unimodular transformation with array reduction recognition, non-loop level parallelism revealing technique, dynamic dataflow analysis and optimization of cross-loop local cache reuses, etc.

本文从而概括了若干具有一般性的实用新技术，如：程序计算量分析、最大潜在并行性分析、数组私有化分析、循环并行性分析等动态程序分析技术；语句数据相关图、过程调用图、循环迭代空间相关图、交互数组私有化、交互幺模变换等可视化语义交互分析变换技术等等；总结了若干自动并行化新技术，如：结合相关和覆盖的数组私有化方法、对多层嵌套循环计算幺模并行化变换矩阵的循环幺模变换方法、结合数组规约识别增强幺模变换的技术、发掘非循环级并行性的技术、动态数据流分析技术、优化利用循环间Cache数据局部性的技术等等。

The minimal vertex-covering problem of graph is a NP-complete problem of graph theory.

图的最小顶点覆盖问题是图论中的一个NP完全问题。

MethodsBased on the structure of gene frequency matrix, we combine the method of multidimensional scaling analysis with the minimal spanning tree of graph theory, to set up the model of graph theory multidimensional scaling analysis.

提出基因频率矩阵的图论多维尺度分析方法，探讨该法在人类群体遗传结构研究中的应用。

In here we study k-fault broadcasting graph in f mode, and give an algorithm to decide the least time in the minimal k-fault f-broadcasting graph. All factors are studied qualitatively.

在这里，我们讨论了f模式下的k容错广播图问题，给出了确定极小k容错f广播图中广播时间的算法，定性分析了各种影响因素的作用效果。

We newly define the minimal broadcasting graph in f mode, and prove the rationality of the definition. We study the essential characters of the minimal f-broadcasting graph and the especial qualities in an special f, which is familiar in the competition self-combination network.

针对f模式重新定义了极小广播图，并证明了定义的合理性；讨论了极小f广播图的基本性质并针对竞争自组网中一种常见的f模式讨论了其特殊性质。

Methods Based on the structure of gene frequency matrix,we combine the method of principle components analysis with the minimal spanning tree of graph theory,to set up the model of graph theory principle components analysis.

结果图论主成分分析的基本步骤可概括为：①对中心化基因频率的协方差矩阵进行主成分分析；②按图论原理求过m维空间n个点的最小生成树；③利用求"颈"法分割最小生成树；④将最小生成树整合到二维主成分散点图中构建图论主成分分类图。

In this paper the capacity of tree-flower in Edmonds theorem of graph theory is extended to minimum covering points and a computing formula of minimum covering points for non-dual graph is introduced.

文中把图论里Edmonds定理的树花容量扩展为最小复盖点，并得到了计算非偶图最小复盖点数的公式。

In this paper, the maximum graph packing and the minimum graph covering of two graphsD_1, D_2 with six vertices and eight edges and the 8-cycle C_8 are researched.

在统一的构作方法下，对于两个六点八边图所有可能的v和λ给出了相应的最大图填充和最小图覆盖的构造。

Factors with prescribed properties such as factors including or excluding some given edge, maximum or minimum factors, factor covering and connected factors; 3. Factorizations of graphs; 4. k-extendable graph and its generalizations. Fractional graph theory is a relatively younger research branch.

例如，因子与图的最小度，韧度，联结数：邻域并等参数之间的关系；2·研究图的有限制条件的因子，例如，有约束条件的因子，图的连通因子，图的最大最小因子；3·图的因子分解；4·k-可扩图及其推广等。

Yet, Edith says, there was always money in the bank.

但是Edith说，她的银行户口里面总是有钱。

We have created a series of files that resolve this problem--one for each day of the 40 days of purpose.

我们制作一系列的档案去解决这问题---一个为标竿40天中的每一天。