| 戴一奇.求最大匹配的一个新算法[J].数学研究及应用,1988,8(4):605~612 |
| 求最大匹配的一个新算法 |
| A New Algorithm for Constructing A Maximum Matching on a Graph |
| 投稿时间：1986-07-05 |
| DOI：10.3770/j.issn:1000-341X.1988.04.026 |
| 中文关键词: |
| 英文关键词: |
| 基金项目: |
|
| 摘要点击次数: 1780 |
| 全文下载次数: 945 |
| 中文摘要: |
| |
| 英文摘要: |
| A new algorithm is proposed for constructing a maximum matching in a simple undirected graph.It uses DFS method and proper datastructure to find a alternating tree. In this way, the treatment of blosson and the determination of augme men ting path become very simple. The complexity of the algorithm is O(mn). |
| 查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|
