该词条未找到_海词词典

您要查找的是不是：

complete balanced bipartite graph 完全等二部图
On 2-Factors with Large Cycles in a Balanced Bipartite Graph 二分图中含大圈的2-因子
On the Adjacent Strong Edge Coloring of Joining Graph with Star and Complete Balanced Bipartite Graph 星和完全等二部图联图的邻强边染色
balanced bipartite graph 均衡二分图
A construting proof on cycles and matchings in balanced bipartite graphs 二分图含圈与对集的一个构造性证明
A Degree Sum Condition of 2-factors with Large Cycles in Balanced Bipartite Graphs 均衡二分图中含有大圈的2-因子的度和条件
Abstract ：Bipartite graph is a special model in the Graph Theory. 摘要：偶图是图论中的一种特殊模型。
balance bipartite graph 均衡二部图
balanced bipartite graphs 均衡二分图
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. 本文提出了一种求解这一问题的算法。
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. 完全偶图是具有二分类的简单偶图。
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. 第一个问题转化为求二部图最小匹配数,第二个问题转化为求二部图中渗透集合每个点的一个匹配。
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的布图设计方面有着重要的应用。