您要查找的是不是:
- bipartite matroid 二部拟阵
- Number1covert to find the minimum matching matroid of bipartite graph,and number2to search for one matching of permeating musters through bipartite graph. 第一个问题转化为求二部图最小匹配数,第二个问题转化为求二部图中渗透集合每个点的一个匹配。
- Bipartite:Having or consisting of two parts. 两部分的:两部分的或由两部分构成的。
- This graph is NOT bipartite, since there are many triangles in it. 这个图不是二部图,因为里面存在许多三角形。
- A graph is bipartite if it does not contain an odd cycle. 一个图是二部图,如果它不包含奇圈。
- Abstract :Bipartite graph is a special model in the Graph Theory. 摘 要 :偶图是图论中的一种特殊模型。
- If |V(G)| is even, then G is either an elementary bipartite graph or a brick. 如果 |V(G) |为偶数 ;则 G或者是一个基本的二部图 ;或者是一个砖块 .
- Moreover, based on these, some relations between matroid and antimatroid are discussed here. 在此基础上,讨论了拟阵与反反拟阵之间的一些关系。
- Graph theory and matroid theory have witnessed an unprecedented growth in the twentieth century. 图论和拟阵理论在二十世纪经历了空前的发展。
- It is proved that a central essential arrangement is irreducible if, and only if, the matroid is connected. 对超平面中心构形 构造了拟阵 ,在超平面构形和拟阵之间建立了对应关系。
- By generalizing the idea of crisp matroid sums to fuzzy matroid, the fuzzy matroid sum is defined. 通过将传统拟阵理论中和的概念推广到模糊拟阵,给出了模糊拟阵的和的定义。
- If enough edges have been drawn to make the figure connected the graph is called bipartite. 如果有足够的线使图连通,这图称为双图。
- Minimum Weight Vertex Covering Set and Maximum Weight Vertex Independent Set in a Bipartite Graph. 二分图的最小点权覆盖集与最大点权独立集。
- In this paper, we study the transitive properties of bipartite tournaments and tournaments, and give the sufficient and necessary conditions of them. 摘要研究了二部竞赛图和竞赛图的传递性,给出了它的充分必要条件。
- 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 enumeration problem is solved for labeled consistent bipartite tournaments,and a sharp formula is obtained. 通过讨论,解决了标定一致二部竞赛图的计数问题,并获得了一个简明计算公式。
- An algorithm for finding all perfect matchings in a given bipartite graph G(X,Y, E) is presented. 本文提出了一种求解这一问题的算法。
- Wepresent two algorithms,based on the Malek and the BGM model,respectively,with a polynomialtime com pleAlty when the test graph is a bipartite groph. 在Malek和BGM模型下,分别提出了一种顺序诊断算法,这些算法在测试图是二部图的情形下都是多项式时间复杂性的。
- Much effort has been spent on investigating the crossing numbers of complete graphs, complete bipartite graphs and cartesian products graphs. 大多的努力是在探求完全图,完全二部图及笛卡尔积图的交叉数。