您要查找的是不是：
- bipartite subgraph 二部子图
- bipartite subgraph problem 二分图问题
- Partition,Subgraph,Degree sum,Maximum degree,Bipartite graph,Vertex-disjoint,Cycles,Paths. 剖分;子图;度和;最大度;二部图;顶点不交;圈;路.
- G is said to be bipartite matching extendable if every matching M whose induced subgraph is a bipartite matching extends to a perfect matching. 称图G是偶匹配可扩的,是指G的每一个偶匹配都可以扩充成为G的一个完美匹配。
- 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的完美匹配。
- Finding a Maximum Density Subgraph. 最大密度子图。
- Bipartite:Having or consisting of two parts. 两部分的:两部分的或由两部分构成的。
- We call such a spanning subgraph T an economical spanning subgraph. 我们称这样的生成子图T为廉价的生成子图。
- This graph is NOT bipartite, since there are many triangles in it. 这个图不是二部图，因为里面存在许多三角形。
- A graph is bipartite if it does not contain an odd cycle. 一个图是二部图，如果它不包含奇圈。
- Second, we find a dense subgraph based on the greedy algorithm. 在第二个步骤，我们利用贪婪演算法找到一个密集的子网路；
- Abstract ：Bipartite graph is a special model in the Graph Theory. 摘 要 ：偶图是图论中的一种特殊模型。
- GString can also facilitate similarity subgraph search. GString也能很方便地支持相似子图搜索问题。
- All you need to do is create your text in a subgraph. 你所要做的是将你的文字创建在一个子图中。
- These questions are special cases of the so called forbidden subgraph problem. 这些问题都是所谓禁用子图问题的特殊情形。
- If |V(G)| is even, then G is either an elementary bipartite graph or a brick. 如果 |V(G) |为偶数 ;则 G或者是一个基本的二部图 ;或者是一个砖块 .
- Finally, we repeat the above phases until no more dense subgraph can be found. 在最后一个步骤，我们重复第一到第三步骤直到我们找不出任何密集的子网路为止。
- The forbidden subgraph problem is a prime example of the rather large family of extremal problems is graph theory. 禁向子图问题是图论中相当大的一类极值问题中的主要例子。
- 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. 二分图的最小点权覆盖集与最大点权独立集。
