未找到相关数据
DNA Computing of Bipartite Graphs for Maximum Matching
被引：0
作者：
Shiying Wang
机构：
来源：
Journal of Mathematical Chemistry
|
2002年
/
31卷
关键词：
maximum matching;
maximal matching;
augmenting path;
DNA computing;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let M be a matching in a graph G. It is defined that an M-augmenting path must obtain one element of M. In this paper, it is obtained that a matching M in a graph G is a maximum matching if and only if G contains no M-augmenting path and M is a maximal matching in G. It supplies a theoretical basis to DNA computing. A detailed discussion is given of DNA algorithms for the solutions of the maximal matching problem and maximum matching one in a bipartite graph.
引用
收藏
页码：271 / 279
页数：8
相关论文