A loopless algorithm for generation of basic minimal interval orders

被引:2
作者
LaFollette, PS [1 ]
Korsh, JF [1 ]
机构
[1] Temple Univ, Dept Comp & Informat Sci, Philadelphia, PA 19122 USA
来源
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS | 2000年 / 17卷 / 03期
关键词
interval order; loopless algorithm; minimal;
D O I
10.1023/A:1026790306863
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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
页数:15
相关论文
共 14 条