首页 | 本学科首页   官方微博 | 高级检索  
     检索      

碰撞数问题Greedy序集的结构
引用本文:闻振卫.碰撞数问题Greedy序集的结构[J].苏州大学学报(医学版),1990,6(3):282-289.
作者姓名:闻振卫
作者单位:苏州大学数学系
摘    要:

关 键 词:序集  碰撞数  Greedy算法  线性扩张

THE STRUCTURES OF GREEDY ORDERED SETS WITH RESPECT TO BUMP NUMBER PROBLEM
Wen Zhenwei.THE STRUCTURES OF GREEDY ORDERED SETS WITH RESPECT TO BUMP NUMBER PROBLEM[J].Journal of Suzhou University(Natural Science),1990,6(3):282-289.
Authors:Wen Zhenwei
Institution:Mathematics Department
Abstract:A finite ordered set is called as a greedy ordered set if each of its greedy linear extensions with respect to bump number problem is optimal. In this paper, it is given the structures of greedy ordered sets
Keywords:ordered set  linear extension  bump numder  heuristic  greedy algorithm  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号