| 最优联系对算法 |
| |
| 引用本文： | 程仕军.最优联系对算法[J].贵州大学学报(自然科学版),1988(3). |
| |
| 作者姓名： | 程仕军 |
| |
| 作者单位： | 贵州大学数学系 贵阳 |
| |
| 摘 要： | 本文引进了联系系统子程序等新概念,推广了 Hausmann 和 Korte 有关拟阵的一个定理。给出了求联系系统的最优联系对和两个联系系统的最优公共联系对的算法并估计了复杂性.
|
| 关 键 词： | 联系系统 联系系统子程序 w 最优联系对 w 最优公共联系对 |
Optimal Linked Pairs Algorithms |
| |
| Cheng Shijun.Optimal Linked Pairs Algorithms[J].Journal of Guizhou University(Natural Science),1988(3). |
| |
| Authors: | Cheng Shijun |
| |
| Abstract: | In this paper the notions of linking systems oracles are introduced and the result of Hausmann and Korte about matroids is generalized. Algorithms for finding the optimal linked pairs of a linking system and the optimal common linked pairs of two linking systems are devised.The complexites of these algorithms are discussed. |
| |
| Keywords: | linking system linking system Oracle w optimal linked pair w optimal common linked pair |
| 本文献已被 CNKI 等数据库收录！ |
