SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 17, Issue 3, 2000, Pages 271-285

A Loopless Algorithm for Generation of Basic Minimal Interval Orders

(2) LaFollette Jr , Paul S a Korsh, James F a

a Temple University (United States)

Author keywords

Interval order; Loopless algorithm; Minimal

Indexed keywords

EID: 0042226622 PISSN: 01678094 EISSN: None Source Type: Journal
DOI: 10.1023/A:1026790306863 Document Type: Article

Times cited : (2)

References (14)

1
- 0016994626
- Efficient generation of the binary reflected gray code and its applications
- Bitner, J. R., Ehrlich, G. and Reingold, E. M. (1976) Efficient generation of the binary reflected gray code and its applications, Comm. ACM 19, 517-521.
- (1976) Comm. ACM , vol.19 , pp. 517-521
- Bitner, J.R.¹ Ehrlich, G.² Reingold, E.M.³

2
- 0002379536
- A loop-free algorithm for generating the linear extensions of a poset
- Canfield, E. R. and Williamson, S. G. (1995) A loop-free algorithm for generating the linear extensions of a poset, Order 12, 57-75.
- (1995) Order , vol.12 , pp. 57-75
- Canfield, E.R.¹ Williamson, S.G.²

3
- 84976666253
- Loopless algorithms for generating permutations, combinations, and other combinatorial objects
- Ehrlich, G. (1973) Loopless algorithms for generating permutations, combinations, and other combinatorial objects, J. ACM 20, 500-513.
- (1973) J. ACM , vol.20 , pp. 500-513
- Ehrlich, G.¹

4
- 0000365128
- Intransitive indifference with unequal indifference intervals
- Fishburn, P. C. (1970) Intransitive indifference with unequal indifference intervals, J. Math. Psych. 7, 144-149.
- (1970) J. Math. Psych. , vol.7 , pp. 144-149
- Fishburn, P.C.¹

5
- 0041603434
- Ph.D. Thesis, Dartmouth College
- Greenough, T. L. Representation and Enumeration of Interval Orders and Semiorders, Ph.D. Thesis, Dartmouth College, 1976.
- (1976) Representation and Enumeration of Interval Orders and Semiorders
- Greenough, T.L.¹

6
- 0028769727
- Loopless generation of k-ary tree sequences
- Korsh, J. F. (1994) Loopless generation of k-ary tree sequences, Inform. Process. Lett. 52, 243-247.
- (1994) Inform. Process. Lett. , vol.52 , pp. 243-247
- Korsh, J.F.¹

7
- 0000656771
- Shifts and loopless generation of k-ary trees
- Korsh, J. F. and Lipschutz, S. (1998) Shifts and loopless generation of k-ary trees, Inform. Process. Lett. 65, 235-240.
- (1998) Inform. Process. Lett. , vol.65 , pp. 235-240
- Korsh, J.F.¹ Lipschutz, S.²

8
- 0009414651
- Multi-set permutations and loopless generation of ordered trees with specified degree sequence
- Korsh, J. F. and LaFollette, P. S. (2000) Multi-set permutations and loopless generation of ordered trees with specified degree sequence, J. Algorithms 34, 309-336.
- (2000) J. Algorithms , vol.34 , pp. 309-336
- Korsh, J.F.¹ LaFollette, P.S.²

9
- 0001416737
- Towers, beads, and loopless generation of trees with specified degree sequences
- LaFollette, P. S. and Korsh, J. F. (1999) Towers, beads, and loopless generation of trees with specified degree sequences, Congr. Numer. 139, 157-166.
- (1999) Congr. Numer. , vol.139 , pp. 157-166
- LaFollette, P.S.¹ Korsh, J.F.²

10
- 0001889834
- On rotations and the generation of binary trees
- Lucas, J. M., Roelants van Baronaigien, D. and Ruskey, F. (1993) On rotations and the generation of binary trees, J. Algorithms 15, 1-24.
- (1993) J. Algorithms , vol.15 , pp. 1-24
- Lucas, J.M.¹ Van Roelants Baronaigien, D.² Ruskey, F.³

11
- 0042637945
- Basic interval orders
- Myers, A. N. (1999) Basic interval orders, Order 16(3), 261-276.
- (1999) Order , vol.16 , Issue.3 , pp. 261-276
- Myers, A.N.¹

12
- 0026202470
- A loopless algorithm for generating binary tree sequences
- Roelants van Baronaigien, D. (1991) A loopless algorithm for generating binary tree sequences, Inform. Process. Lett. 39, 189-194.
- (1991) Inform. Process. Lett. , vol.39 , pp. 189-194
- Roelants Van Baronaigien, D.¹

13
- 0003688872
- Technical Report DCS-25401R, Department of Computer Science, University of Victoria
- Roelants van Baronaigien, D. (1997) Loopfree generation of k-ary trees, Technical Report DCS-25401R, Department of Computer Science, University of Victoria.
- (1997) Loopfree Generation of K-ary Trees
- Roelants Van Baronaigien, D.¹

14
- 0032203353
- On the loopless generation of binary tree sequences
- Vajnovski, V. (1998) On the loopless generation of binary tree sequences, Inform. Process. Lett. 68, 113-117.
- (1998) Inform. Process. Lett. , vol.68 , pp. 113-117
- Vajnovski, V.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.