期刊文献+

A POLYNOMIAL ALGORITHM FOR FINDING A BUMP OPTIMAL EXTENSION OF AN ORDERED SET

A POLYNOMIAL ALGORITHM FOR FINDING A BUMP OPTIMAL EXTENSION OF AN ORDERED SET
原文传递
导出
摘要 A polynomial algorithm for finding a linear extension of an ordered set which has theminimum bumps is presented. A polynomial algorithm for finding a linear extension of an ordered set which has theminimum bumps is presented.
作者 李慰萱
出处 《Systems Science and Mathematical Sciences》 SCIE EI CSCD 1991年第1期14-19,共6页
关键词 BUMP NUMBER LINEAR EXTENSION algorithm ORDERED SET combinatorial optimization Bump number linear extension algorithm ordered set combinatorial optimization
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部