二图

二图缩减改进节点法

The Reduce and Improvement Nodal Method of Two Pattern

第二种图是0（1，b，c、d）。

The second family of graphs is θ( 1 , b , c , d ) .

对于二分图，弱s-弧传递性是由围长g和直径d决定的，而且还得到与s-弧传递性相一致的两个必要条件：即s存在上界（g+2）/2；

For the non-bipartite graphs , weakly s-arc transitivity is equivalent to s-arc transitivity ;

图的最小完整度有约束条件的二分图的（g，f）-因子

Minimum Integrity of Graphs MINIMUM DEGREE FOR f FACTOR

每个UML图都属于这二个图范畴。

Every UML diagram belongs to one these two diagram categories .

用8长圈C8最大填充和最小覆盖完全二部图K（m，n）

Maximal Packing and Minimal Covering of the Complete Bipartite Graph K_ ( m , n ) with C_8 ;

二部图上的K（1，m）划分问题

Partition problems of bipartite graphs

一类基于二部图的（g，f）-2-覆盖图的研究

Research on a Type of ( g , f ) - 2-Covered Graphs Based on Bipartite Graphs

本文还用图谱方法，证明了完全二分图K（m，n）的圈唯一性。

The circuit uniqueness of the complete bipartite graph Km , n is also proved by using spectral method .

关于（g，f）-消去和（g，f）-2-消去的二分图

On ( g , f ) - deleted and ( g , f ) - 2-deleted bipartite graphs

考虑了二部图上的V-K1，m划分问题。

| V | - K_ ( 1 , m ) partition problems of bipartite graphs were considered .

首先建立了多总线系统三种容错性指标（总线容错度Tb、处理机容错度Tp、混合容钳度T（bp））与相应的二元图连通度的关系。

Some results are presented which related fault-tolerance degrees of a multibus system with the connectivity of the bipartite graph induced by the system .

你可以用它来制作USB手指的背景图片，就像第二幅图。

You can use this programme to make backgrounds for your USB thumb drives like the second image .

作为完全图的最优完全二部图分解的推广，引进了完全k一致超图的最优k团分划的新概念；

The optimal k-clique partition of complete k-uniform hypergraphs is introduced as a generalization of the optimal complete bipartite decomposition of complete graphs .

给出了新的DNA二雏图表示。证明了该表示是非退化的，并提出了一种新的DNA相似度计算方法。

This paper gives a new2-D graphical representation of DNA proving that the representation is not degen-eratod , and providing a new calculating method of resemblance .

第一张图针对WindowsNT系统，第二张图针对RS/6000系统。

The first graph is for a Windows NT system , and the second is for an RS / 6000 system .

本文给出了均衡二分图有一个2-因子恰含k个大圈的度条件。

In this paper , we investigate the degrees condition which implies that a balanced bipartite graph has a 2-factor with exactly k vertex-disjoint large cycles .

结合Thinning技术和Snake模型，提出了一个平面二值图的动态骨架算法。

In this paper , a dynamic skeleton algorithm for binary images is presented by combining with thinning method and Snake model technique .

探讨了完全二部图Km1，m2，完全图卡氏积图Km×Kn和完全图并图Km+Kn的表示数。

The complete bipartite graph Km 1 , m2 , product Km × Kn and sum Km + Kn are discussed here .

本文给出了完全二部图Km，n的P2k+1&因子分解存在的必要条件，同时论证了充分条件的二种特殊情况。

In this paper , the necessary condition for the existence of a P2k + 1 & factorization of Km , n is given . Two cases of sufficient conditions are discussed .

过程Petri网中基于活动的复合二分图，从虚拟现实的角度为制定科学合理的全程决策提供了模板和指导。

The compound binary graph based on the activities in process 's Petri network provided an instructional formwork for scientific and logical global decision-making from the point of view of virtual realism .

其中梯形图的表示使用基于二叉图的模型，能够有效地完成PLC编辑所涉及的插入、删除和修改等操作，同时提供了简便的编译算法。

The express of the Ladder Diagram which uses the model based on the Binary diagram can complete the operation about insert , delete and amend of the editor of Soft PLC , and also provide handy algorithms .

对二部图而言，完全匹配必为最大匹配，且具有完全匹配的二部图必须满足V1与V2中顶点个数相同，采用回溯的递归算法，可求出二部图的所有完全匹配。

This paper give the recursive algorithm for tracing back . It can find out the all complete matching of a bipartite graph .

该方法有效地回避了传统主线提取方法对图像进行增强去噪、定位ROI、分割掌纹二值图等复杂度较高的计算，直接在全手掌灰度图像上进行主线的跟踪。

This method effectively avoids the complex computing on images enhancing , ROI positioning and palm-print image binaryzation in traditional methods and tracks principal lines on gray level image directly .

然后针对所得到的有用帧，根据人体肤色的H值的聚类特性，采用基于HSV肤色模型中H值的方法分割出手势区域，得到二值图。

To the useful image frame we get , then we separate the hand area based on H value of HSV model according to clustering character of H value of human skin color , and get the binary image .

在对二部图及匹配的概念做了进一步阐述后，使用类C语言描述了如何识别无向图是否二部图及如何在二部图中寻找最大匹配乃至完全匹配的算法。

Behind seting forth Bipartite Graph and Matching , this article describe some algorithm to distinguish Undigraph whether it is Bipartite Graph and how to explore maximal Matching and even complete Matching in the Bipartite Graph which has better worth on application of computer by language of similar C.

RLC-Nullor网络的有向二分图及其回归差的拓扑公式

Orientation Bipartite Graph for RLC-Nullor Network and Topological Formula for the Return Difference

最后，根据校准法反演计算现行设计规范中钢筋混凝土结构抗弯、抗压可靠度指标以确定在用桥梁结构体系的最低目标可靠度指标。有约束条件的二分图的（g，f）-因子

Lastly , the minimum permission reliability index is offered by the method of " calibration method " which makes back calculation out of the bending resistance reliability and the compression resistance reliability of the reinforced concrete member in norm . MINIMUM DEGREE FOR f FACTOR

讨论了完全二部图的因子分解，并给出了4Km，n存在K1,4-因子分解的充分条件。

In this paper , the factorization of a bipartite multigraph is investigated , and a sufficient condition for 4 K m , n to have a K_ ( 1,4 ) factorization is presented .

本文的主要工作包括：1.在目标提取方面，提出了一种改进的使用局部二元图（LBP）的基于纹理的算法。

The main research work includes : 1 . In the aspect of object detection , an improved texture-based method using local binary patterns ( LBP ) for background subtraction is proposed .