您要查找的是不是：
- An Optimal Method of Bipartite Graph Matching for Underconstrained Geometry Solving 一种面向欠约束几何系统求解的二部图匹配优化处理方法
- Presentation of Protocol Model for Bipartite Graph Match Scheduling Algorithm Based on Input Switching Queues 基于输入交换队列的双向图匹配调度算法的协议模型表示
- bipartite graph matching 二部图匹配
- bipartite graph match 双向图匹配
- G is said to be bipartite matching extendable (BM-extendable) if every matching M whose induced subgraph is a bipartite graph extends to a perfect matching of G. 称G是偶匹配可扩的，如果G中导出子图是偶图的匹配对都可以扩充为G的完美匹配。
- Number1covert to find the minimum matching matroid of bipartite graph,and number2to search for one matching of permeating musters through bipartite graph. 第一个问题转化为求二部图最小匹配数,第二个问题转化为求二部图中渗透集合每个点的一个匹配。
- Abstract ：Bipartite graph is a special model in the Graph Theory. 摘 要 ：偶图是图论中的一种特殊模型。
- 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. 基于线性规划对偶理论和图论的相关知识，我们首先证明了匹配对策有稳定核心当且仅当其基础二部图有完美匹配。
- If |V(G)| is even, then G is either an elementary bipartite graph or a brick. 如果 |V(G) |为偶数 ;则 G或者是一个基本的二部图 ;或者是一个砖块 .
- Minimum Weight Vertex Covering Set and Maximum Weight Vertex Independent Set in a Bipartite Graph. 二分图的最小点权覆盖集与最大点权独立集。
- Partition,Subgraph,Degree sum,Maximum degree,Bipartite graph,Vertex-disjoint,Cycles,Paths. 剖分;子图;度和;最大度;二部图;顶点不交;圈;路.
- Inthis method,a bipartite graph structure is used to track potentially intersecting faces. 该方法主要是利用二部图跟踪两个细分曲面中可能相交的面。
- An algorithm for finding all perfect matchings in a given bipartite graph G(X,Y, E) is presented. 本文提出了一种求解这一问题的算法。
- incomplete optimal matching of bipartite graph 不完全最优匹配
- The gracefulness of graceful bipartite graph joining path was discussed and the same amalgamated product of the graph was also discussed. 文章讨论了优美二部图粘接路所得图的优美性以及这类图的一种混合积的优美性。
- The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints. MSS 问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
- A complete bipartite graph is a simple bipartite graph with bipartition. 完全偶图是具有二分类的简单偶图。
- Finding all perfect matchings in a given bipartite graph has importantapplications to the global routing and channel ordering for VLSI building block layout. 求给定偶图的所有完备匹配问题在LSI/VLSI的布图设计方面有着重要的应用。
- A flow graph matching algorithm has been implemented on the Connection Machine which employs parallel techniques to allow efficient subgraph matching. 本文乃是对生物膜反应器之废水处理进行模拟，以期能在废水处理上得到较佳的数学模式。
- Describing some Algorithm for Bipartite Graph and Matching 二部图及匹配算法的描述
