| 二部图的(g,f)匹配 |
| |
| 引用本文： | 谢政.二部图的(g,f)匹配[J].国防科技大学学报,1991,13(3):73-78. |
| |
| 作者姓名： | 谢政 |
| |
| 作者单位： | 国防科技大学系统工程与应用数学系 |
| |
| 摘 要： | 本文证明了二部图存在(g,f)匹配和f 因子的充要条件以及有关的几个结果,并且给出了求二部图的最大(g,f)匹配、最小(g,f)匹配和最小权最大f 匹配、最小权(g,f)匹配、最大权(g,f)匹配的算法。
|
| 关 键 词： | 运筹学 图论 网络流 算法 二部图 (g f)匹配 f 因子 |
| 收稿时间： | 1990/3/22 0:00:00 |
(g,f)-Matchings of Bipartite Graphs |
| |
| Xie Zheng.(g,f)-Matchings of Bipartite Graphs[J].Journal of National University of Defense Technology,1991,13(3):73-78. |
| |
| Authors: | Xie Zheng |
| |
| Institution: | Department of System Engineering and Applied Mathematics |
| |
| Abstract: | In this paper,the sufficient and necessary condition of the existence theorems for(g,f)-matchings and f-factors of bipartite graphs and several related results are proved.We give the al-gorithms to solve the maximum(g,f)-matching,the minimum(g,f)-matching,the minimumweighted maximum f-matching,the minimum weighted(g,f)-matching and the maximumweighted(g,f)-matching of bipartite graphs. |
| |
| Keywords: | operations research graph theory network flows algorithms bipatite graphs (g f)-matchings f-factors |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
|
