重庆理工大学学报：自然科学Issue(8)：75-77,3.
一种基于邻接矩阵的二部图判定算法
Algorithm of Bipartite Graph Decision Based on Adjacency Matrix
摘要
Abstract
Bipartite graph is an important graph in modern graph theory.However,there are few sufficient algorithms to decide the bipartite graph.According the definition of bipartite graph,a new decision algorithm based on adjacency matrix is introduced,which adds inner vertex between two vertexes to test length of path,we measure many data and the performance of experiment shows that the new algorithm solves the problem of bipartite graph decision successfully.关键词
二部图判定/邻接矩阵/路径长度/奇圈Key words
bipartite graph decision/adjacency matrix/length of path/odd cycle分类
信息技术与安全科学引用本文复制引用
王敏,韩俊英..一种基于邻接矩阵的二部图判定算法[J].重庆理工大学学报：自然科学,2011,(8):75-77,3.基金项目
甘肃省自然科学基金资助项目 （）
