A Loopless Algorithm for Generation of Basic Minimal Interval Orders

被引：0
作者：
Paul S. LaFollette
James F. Korsh
机构：
[1] Temple University,Computer & Information Sciences Department
来源：
Order | 2000年 / 17卷
关键词：
interval order; loopless algorithm; minimal;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Erhlich introduced the concept of generating combinatorial structures in constant time per generated item. Such algorithms are called “loopless” and have been described for many objects. Myers introduced the idea of a basic minimal interval order. This paper presents a loopless algorithm for generating basic minimal interval orders.
引用
收藏
页码：271 / 285
页数：14
相关论文
共 20 条
  • [1] Bitner J. R.(1976)Efficient generation of the binary reflected gray code and its applications Comm. ACM 19 517-521
  • [2] Ehrlich G.(1995)A loop-free algorithm for generating the linear extensions of a poset Order 12 57-75
  • [3] Reingold E. M.(1973)Loopless algorithms for generating permutations, combinations, and other combinatorial objects J. ACM 20 500-513
  • [4] Canfield E. R.(1970)Intransitive indifference with unequal indifference intervals J. Math. Psych. 7 144-149
  • [5] Williamson S. G.(1994)Loopless generation of Inform. Process. Lett. 52 243-247
  • [6] Ehrlich G.(1998)-ary tree sequences Inform. Process. Lett. 65 235-240
  • [7] Fishburn P. C.(2000)Shifts and loopless generation of J. Algorithms 34 309-336
  • [8] Korsh J. F.(1999)-ary trees Congr. Numer. 139 157-166
  • [9] Korsh J. F.(1993)Multi-set permutations and loopless generation of ordered trees with specified degree sequence J. Algorithms 15 1-24
  • [10] Lipschutz S.(1999)Towers, beads, and loopless generation of trees with specified degree sequences Order 16 261-276
12