| 拟阵与贪婪算法 |
| |
| 引用本文： | 朱一心,黄平安.拟阵与贪婪算法[J].徐州师范大学学报(自然科学版),1999(3). |
| |
| 作者姓名： | 朱一心 黄平安 |
| |
| 作者单位： | 徐州师范大学数学系!江苏徐州221009(朱一心)，湖南税务高等专科学校基础部!湖南长沙410116(黄平安) |
| |
| 摘 要： | 给出拟阵的等价条件及拟阵中 ｋ 元集的个数，最后对加权拟阵用贪婪算法算出所有最重元．
|
| 关 键 词： | 拟阵 贪婪算法 最重元 |
Matroid and Greedy Algorithm |
| |
| ZHU Yi xin ,HUANG Ping an.Matroid and Greedy Algorithm[J].Journal of Xuzhou Normal University(Natural Science Edition),1999(3). |
| |
| Authors: | ZHU Yi xin HUANG Ping an |
| |
| Institution: | ZHU Yi xin 1,HUANG Ping an 2 |
| |
| Abstract: | The present paper deals with the equivalent conditions of the definition of matroid, gives out an inequality about the number of k element sets in a matroid, and then by using greedy algorthm finds out all the elements in a matroid. |
| |
| Keywords: | matroid greedy algorithm the weightest element |
| 本文献已被 CNKI 等数据库收录！ |
