二分图

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

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

本文给出了均衡二分图有一个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 .

基本极大（m+1）K2-free二分图

Basic Maximal ( m + 1 ) K_2-free Bipartite Graph

对于二分图，弱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

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

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

综述了End－正则图的进展，刻画了End－完全正则的二分图，讨论了更广的图类End－Lpp图的性质。

A survey of End-regular graphs is given , End-completely regular bipartite graphs are characterized , and the property of End-lpp graphs is 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 .

针对增值业务的故障定位需求，以概率加权二分图为故障传播模型，借鉴贪婪思想，提出了一种高效的启发式概率故障定位算法BSD（BayesianSuspectDegree）。

Considering the requirements of probabilistic fault localization for value-added services , we present a heuristic fault localization algorithm called BSD ( Bayesian Suspect Degree ) based on probabilistic bipartite graph and greedy idea .

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

将二分图故障传播模型的故障诊断问题转化为集合覆盖问题，借鉴启发式贪婪算法，设计了最大覆盖算法MCA和MCA+。

By transforming the fault diagnosis in bipartite FPM into a set-covering problem , two window-based fault localization algorithms MCA ( Max-Covering Algorithm ) and MCA + are proposed , based on the heuristic greedy algorithm .

Gallager在1962年提出的低密度奇偶校验码（Low-DensityParity-CheckCodes，LDPC）是一类可以用稀疏矩阵或二分图定义的线性分组码。

Low-density parity-check codes ( LDPC ) first discovered by Gallager in 1962 are a class of linear block error-correcting codes that can be defined by the very sparse parity-check matrix or the bipartite graph .

目前只有几类图族的部分交叉数是确定的，例如完全图，完全二分图，笛卡尔积图，广义Petersen图等。

Only a part of crossing numbers of several graph families have been determined , such as generalized Petersen graphs , complete graphs , complete bigraphs , Cartesian graphs and so on .

根据已知的四类蛋白质家族（酶，GPCR，离子通道和核受体）以及与之相互作用的药物数据，提出了一种基于改进的二分图学习方法来预测药物靶标相互作用网络。

An improved bipartite graph learning approach was developed to predict drug-target interaction network for four classes of enzymes , ion channels , G-protein coupled receptors ( GPCR ) and nuclear receptors .

本文将不定导纳矩阵的伴随有向二分图的概念推广运用于RLC-Nullor网络。

This paper extends the application of the concept of the accompanying orientation bipartite graph of the indefinite-admittance matrix to the RLC-Nullor network .

提出了一个基于Hopfield网络的可降阶VLSI/WSI阵列重构算法，根据阵列中缺陷单元分布的二分图模型，将问题映射为相应的神经网络，有效地解决了阵列的重构问题。

A nerual network approach for degradable VLSI / WSI arrays reconfiguration on the Hopfield network is proposed on the basis of the bipartite graph of the fault element . The problem is mapped onto the Hopfield network , thus solving the problem of arrays reconfiguration .

根据二分图上校验节点的定义，对和积算法给出了一种不同于Gallager的推导方法。

On the basis of the definition of the check nodes on the Tanner graph , it presents another deduction method of sum-product algorithm that is different from that of Gallager ' s.

通过在软件中采用网络拓扑技术[4]和二分图匹配[5]以及Dijkstra算法[5]等方法，成功地解决了设备端子排和电缆表的自动生成问题，并对设计结果进行了优化。

By using the network topological technique [ 4 ] , bipartite graph matching technique [ 5 ] and Dijkstra algorithm [ 5 ] , the software can generate the electrical device terminals and cable list automatically , meanwhile , the design result is optimized .

利用随机二分图建模ALWAYS-GO-LEFT算法，研究了在分组的两部分不对称情况下，负载方差的变化规律；

Using random-bipartite-graph to model ALWAYS-GO-LEFT algorithm , the laws of standard deviations changes under the condition of asymmetry between two parts are studied .

给出图的点团二分图和边团二分图具有强Helly性质的充分必要条件，证明了使点团二分图具有强Helly性质的图的团贪心性和团不变性。

This paper gives the necessary and sufficient conditions for the vertex-clique bipartite graph and the edge-clique bipartite graph of a graph to hold the strong Helly propery . It is also shown that the class of graphs whose vertex-clique graphs hold the strong Helly property is clique-invariant .

二分图的无关分解及其在覆盖问题中的应用

Independent Separation of Bipartite Graph and its Application in Cover Problem

基于二分图的装配体检索研究

Research on Assemblies Retrieval and Indexing Based on Bipartite Graph

一种基于二分图最优匹配的重复记录检测算法

Duplicate Record Detection Method Based on Optimal Bipartite Graph Matching

基于二分图完美匹配的布尔匹配算法

Boolean Mapping Algorithm Based on Perfect Matching of Bipartite Graph

均衡二分图中存在哈密顿因子的条件

Condition on existence of Hamiltonian factor in balanced bipartite graph

基于二分图的乘积码迭代译码算法

Iterative Decoding Algorithm for Product Codes Based on Bipartite Graphs

用有向二分图分析网络函数及网络灵敏度

Network functions and network sensitivity analysis using directed bipartite graph

匈牙利算法是图论中完成二分图匹配的经典算法之一。

Hungary algorithm is a classical one to solve bipartite graph matching problem .

本文最后研究了图的弱s-弧传递性（s≥2），证明了对于非二分图，弱s-弧传递性和s-弧传递性是等价的；

Moreover , weakly s-arc transitive graphs are studied .