查询词典 figurative graph

The fill-in minimization problem comes from the elimination process of sparse matrix computation. In a graph-theoretic version for a graph G, it is to find a set F of added edges such that the graph G+F is chordal and |F| is minimized.

起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G+F是弦图。

If G is a {2K_1+K_2, C_4}-free graph, we show thatifα＞3 then G is a split graph, and ifα=3 then for any independentset S of cardinality 3, G-S is a chordal graph or G-S?

如果图G不含与4-圈和2K_1+K_2同构的导出子图，我们证明了如果α＞3，那么G是一个split图；如果α=3，那么对于G的任一个有三个元素的独立集S，G-S是一个弦图或者G-S？

That is, network coding has a larger rate region in a multicast CIOQ switch. Moreover, the graph-theoretic characterization was given out. With the concepts of stable set polytope from the enhanced conflict graph, it is pointed out that computing the offline schedule can be reduced to certain graph coloring problems.

文章证明了对一个流中的分组进行线性网络编码可以承载不允许网络编码时不能够承载的交换流量模式，也就是说，网络编码允许CIOQ交换结构在实现组播服务时有更大的速率区域，并给出了基于图论方法的描述。

It is advisable that Chinese summary is controlled with 300 words, english summary should agree with meaning of Chinese summary article, with 200 substantival and advisable. 5, graph, watch is followed civil appear, have axiomatic sex, graph with necessary in the limit of, avoid by all means and literal content repeat, it is clear that line of value of coordinate of graph Chinese word, symbol, freely, mark value must be written, mark eye should use standard physical quantity and unit symbol, form is used 3 lines...

中文摘要以300字左右为宜，英文摘要应和中文摘要文意一致，以200个实词为宜。5、图、表随文出现，有自明性，图以必要为限，切忌和文字内容重复，图中文字、符号、纵横坐标值、标值线必须书写清楚，标目应使用标准的物理量和单位符号，表格采用三线。。。

The concept"attachable graph"and the enumeration method of pates and circuits on the graph are proposed. With the graph, the gear arrangement problem can be solved. The new method and procedure of GLM type synthesis are presented. With general type synthesis method, Attachable Linkage Kinematic Chain could be generated.

用一般平面连杆运动链类型综合的方法可生成ALKC，然后通过在ALKC上配置齿轮模块得到NGLKC，再在NGLKC上用一定方法设置焊点生成WGLKC，进而选取机架和原动件，即可完成GLM的类型综合。

Basing on this, this paper proposes a generalized shortest path method. That is, by constructing an intermodal-network multi-ply graph which interrelates the data and information in transit with the nodes and sides of the graph, adding virtual origin and destination stations to the graph, and then analyzing transport costs and transfer costs, this paper applies the Dijkstra algorithm to solve the intermodal optimal transport path problem so as to get the intermodal transport plan with the least generalized costs.

在此基础上，提出一种求解最佳运输路线的广义最短路法，即通过构建多式联运网络多重图，将运输过程中的数据、信息和图中的节点、边关联起来，然后对运输费用和中转费用进行分析估计，并通过在联运网络图中加入虚拟的发、到站，使得该问题可用Dijkstra算法进行求解，从而获得广义费用最少的联运方案。

The ancient and simple brick sculpture on the gate The brick sculpture art of old local houses is very fine from the gate to the screen wall and from the door to the window,everywhere is beautiful designs which are made by the way of figurative graph,meaning and similar sound to show something.

17《门头上古朴的砖雕》古民居的砖木雕刻艺术也非常精湛，从大门到照壁，从门扇到窗户，处处都有精美的图案。这些图案大多通过象形、会意、谐音等手法构求艺术语言，来托物寄情。

The set of jobs is specified using a directed acyclic graph, where each job is a node in the graph.

任务集是通过一个有向无环图来定义的，每个任务就是图中的一个节点。

As the graph of Bayesian network is required to be a directed acyclic graph, which was changed during the constructing process, checking for cycle is need in the interaction.

由于贝叶斯网的网络结构要求为一有向无环图，并且此图在交互建网过程中时刻变化，所以要在交互过程中反复检测环路是否存在。

The commit objects form a directed acyclic graph, because they have parents, and the graph of commit objects is acyclic (there is no chain which begins and ends with the same object).

交付对象是按一个单向非环路是图的形式来组织的，因为他们有父辈，以及非环路视图（不存在开始和结尾都是同一个对象的情况）。

Listen,point and check your answers.

听，指出并且检查你的答案。

Warming needle is one of effective treatment methods for knee arthralgia aggravated by cold,and it is simple,safety,so it should be developed in clinical acupuncture and moxibustion extensively.

但以本院科针灸门诊在2005年1月—2006年6月期间共收治膝痛患者100余例，经过临床的诊断后，其中施以温针治疗的48例，疗效显著，报道如下。1临床资料本组病例48