文件名称:Maximal
介绍说明--下载内容均来自于网络,请自行研究使用
分图又称作二部图,是图论中的一种特殊模型。 设G=(V,E)是一个无向图,如果顶点V可分割为两个互不相交的子集(A,B),并且图中的每条边(i,j)所关联的两个顶点i和j分别属于这两个不同的顶点集(i in A,j in B),则称图G为一个二分图。-Bipartite graph is also called a bipartite graph, graph theory, a special model. Let G = (V, E) is an undirected graph, vertex V can be divided into two disjoint subset (A, B), and in each edge (i, j) is associated with two vertices i and j, respectively belonging to these two different set of vertices (i in A, in B), then G is a bipartite graph.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
二分图相关问题.ppt