咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献

馆藏范围

  • 1 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1 篇 理学
    • 1 篇 数学

主题

  • 1 篇 jump number
  • 1 篇 NOT FOUND
  • 1 篇 extension lattic...
  • 1 篇 06a10 partial or...
  • 1 篇 min-max theorem
  • 1 篇 NOT FOUND
  • 1 篇 polynomial algor...
  • 1 篇 NOT FOUND
  • 1 篇 NOT FOUND
  • 1 篇 bump number
  • 1 篇 NOT FOUND
  • 1 篇 linear extension

机构

  • 1 篇 tech univ berlin...
  • 1 篇 mcmaster univ fa...
  • 1 篇 ecole natl super...

作者

  • 1 篇 steiner g
  • 1 篇 mohring rh
  • 1 篇 habib m

语言

  • 1 篇 英文
检索条件"主题词=68C25 computational complexity and efficiency of algorithms"
1 条 记 录,以下是1-10 订阅
排序:
cOMPUTING THE BUMP NUMBER IS EASY
收藏 引用
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLIcATIONS 1988年 第2期5卷 107-129页
作者: HABIB, M MOHRING, RH STEINER, G ECOLE NATL SUPER TELECOMMUN BRETAGNE DEPT INFORMATBRESTFRANCE TECH UNIV BERLIN FACHBEREICH MATHD-1000 BERLIN 12FED REP GER MCMASTER UNIV FAC BUSINESSHAMILTON L8S 4L8ONTARIOCANADA
The bump number b(P) of a partial order P is the minimum number of comparable adjacent pairs in some linear extension of P. It has an interesting application in the context of linear circuit layout problems. Its deter... 详细信息
来源: 评论