bipartite graph

on the adjacent strong edge coloring of joining graph with star and complete balanced bipartite graph

星和完全等二部图联图的邻强边染色

Boolean Mapping Algorithm Based on Perfect Matching of Bipartite Graph

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

This article gives a solution to the programming 0-1 problem whose objective function is a nonlinear function, by applying weighted bipartite graph and perfect matching.

本文对一种目标函数为非线性函数的0&1规划问题提出了一种运用赋权偶图及完美对集的求解方法。

In this paper, a new method for image retrial using color moments of partitions and minimum cost perfect matching for a weighted bipartite graph based on im.

文中利用分块颜色矩，借助带权二部图的最小完美匹配提出了一种新的相似度量方法，既考虑了颜色的空间分布关系，又具有旋转、平移不变性。

A Max-min Weight Perfect Matching in Bipartite Graph with Two Edge Weights

赋双权二部图中最大权最小权完美匹配

The theory involved takes its reference from the Matching of Bipartite Graph theory.

问题的理论部分来自于图论的二分图匹配.

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

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

Duplicate Record Detection Method Based on Optimal Bipartite Graph Matching

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

A complete bipartite graph is a simple bipartite graph with bipartition.

完全偶图是具有二分类的简单偶图.

In light of this, a bipartite graph based on elevator landing and elevator group is designed in this paper.

本文研究出一种基于呼梯信号和电梯群的二部图模型。

Record Cluster Matching Model and Its Algorithm Based on Weighted Bipartite Graph

基于赋权二部图的记录簇匹配模型及其算法

The matching degree of vectors is gained in the way of developed perfect matching algorithm of bipartite graph.

运用改进的二分图的完美匹配算法，得到矢量数组的匹配度。

Bipartite Graph is important data structure for data base system etc.

二部图是数据库等应用系统的重要的数据结构。

Network functions and network sensitivity analysis using directed bipartite graph

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

An improved Boolean matching algorithm based on transforming the mapping between Boolean variables into the problem of perfect matching of bipartite graph is presented.

提出了一种改进的基于二分图完美匹配的布尔匹配算法。

Using the best connectivity bipartite graph, we also present two classes of multibus systems which have the best degree of bus fault tolerance and the best degree of bus-processor fault tolerance as well as better degree of processor fault tolerance.

然后，借助于二元图的最佳连通性，就一般情形，提出了两类多总线系统，它们具有最优总线容错度、最优混合容错度和较优处理机容错度。

The tight upper and lower bounds of the number of removable ears in a non-bipartite graph on v verties ( v ≥ 6) are determined, which are 3 ( v-1)( v-2)/ 2 and 3 respectively.

得到了有v个顶点（v≥6）非二部1-可扩图的可去耳朵数的紧的上、下界分别为3（v-1）（v-2）/2和3。

Independent Separation of Bipartite Graph and its Application in Cover Problem

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

Based on duality theory of linear programming and graph theory, it is proved that the matching game defined on a bipartite graph has the stable core if and only if the graph has a perfect matching.

基于线性规划对偶理论和图论的相关知识，我们首先证明了匹配对策有稳定核心当且仅当其基础二部图有完美匹配。

The algorithm can efficiently cluster paratactic words in large Chinese corpus through the approximation of the dense sub-graph mining algorithm into bipartite graph.

该算法利用二分图的密集子图挖掘近似算法，能够高效地对海量中文语料库中的并列短语进行聚类。

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

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