SCOPUS 정보 검색 플랫폼

ACM Transactions on Algorithms

Volumn 6, Issue 3, 2010, Pages

An explicit universal cycle for the (n - 1)-permutations of an n-set

(2) Ruskey, Frank a Williams, Aaron a

a UNIVERSITY OF VICTORIA (Canada)

Author keywords

Loopless algorithm; Universal cycle

Indexed keywords

CAYLEY GRAPHS; CIRCULAR ARRAYS; CONSTANT TIME; DIRECTED GRAPHS; EFFICIENT ALGORITHM; EULERIAN; EXPLICIT CONSTRUCTIONS; HAMILTON CYCLE; ITERATIVE ALGORITHM; JACKSON; LOOPLESS; LOOPLESS ALGORITHM; RECURSIONS;

DATA STRUCTURES; GRAPH THEORY;

ALGORITHMS;

EID: 77954420399 PISSN: 15496325 EISSN: 15496333 Source Type: Journal
DOI: 10.1145/1798596.1798598 Document Type: Article

Times cited : (38)

References (12)

1
- 33747128854
- Universal cycles for combinatorial structures
- CHUNG, F., DIACONIS, P., AND GRAHAM, R. 1992. Universal cycles for combinatorial structures. Discr. Math. 110, 43-59.
- (1992) Discr. Math. , vol.110 , pp. 43-59
- Chung, F.¹ Diaconis, P.² Graham, R.³

2
- 0039333074
- Some hamilton paths and a minimal change algorithm
- EADES, P., HICKEY, M., AND READ, R. C. 1984. Some Hamilton paths and a minimal change algorithm. J. ACM 31, 19-29.
- (1984) J. ACM , vol.31 , pp. 19-29
- Eades, P.¹ Hickey, M.² Read, R.C.³

3
- 0008782949
- Necklaces of beads in k colors and k-ary de bruijn sequences
- FREDRICKSEN, H. AND MAIORANA, J. 1978. Necklaces of beads in k colors and k-ary de Bruijn sequences. Discr. Math. 23, 207-210.
- (1978) Discr. Math. , vol.23 , pp. 207-210
- Fredricksen, H.¹ Maiorana, J.²

4
- 0011275267
- A survey: Hamiltonian cycles in cayley graphs
- GALLIAN, J. AND WITTE, D. 1984. A survey: Hamiltonian cycles in Cayley graphs. Discr. Math. 51, 293-304.
- (1984) Discr. Math. , vol.51 , pp. 293-304
- Gallian, J.¹ Witte, D.²

5
- 8344279952
- An efficient implementation of the eades, hickey, read adjacent interchange combination generation algorithm
- HOUGH, T. AND RUSKEY, F. 1988. An efficient implementation of the Eades, Hickey, Read adjacent interchange combination generation algorithm. J. Combin. Math. Combin. Comput. 4, 79-86.
- (1988) J. Combin. Math. Combin. Comput. , vol.4 , pp. 79-86
- Hough, T.¹ Ruskey, F.²

6
- 77954419127
- Universal cycles of k-subsets and k-permutations
- JACKSON, B. 1996. Universal cycles of k-subsets and k-permutations. Discr. Math. 149, 123-129.
- (1996) Discr. Math. , vol.149 , pp. 123-129
- Jackson, B.¹

7
- 68049111436
- Universal cycles for permutations
- JOHNSON, R. J. 2009. Universal cycles for permutations. Discr. Math. 309, 17, 5264-5270.
- (2009) Discr. Math. , vol.309 , Issue.17 , pp. 5264-5270
- Johnson, R.J.¹

8
- 0003657590
- Generating All Tuples and Permutations, Fascicle 2. Addison-Wesley
- KNUTH, D. E. 2005. The Art of Computer Programming, Vol. 4, Generating All Tuples and Permutations, Fascicle 2. Addison-Wesley.
- (2005) The Art of Computer Programming Vol. 4
- Knuth, D.E.¹

9
- 77954413573
- PAK, I. AND RADOICIC, R. 2004. Hamiltonian paths in Cayley graphs. manuscript.
- (2004) Hamiltonian Paths in Cayley Graphs. Manuscript
- Pak, I.¹ Radoicic, R.²

10
- 84976776124
- Permutation generation methods
- SEDGEWICK, R. 1977. Permutation generation methods. ACM Comput. Surv. 9, 137-164.
- (1977) ACM Comput. Surv. , vol.9 , pp. 137-164
- Sedgewick, R.¹

11
- 0003633725
- SLOANE, N. J. A. The online encyclopedia of integer sequences. http://www.research.att.com/-njas/sequences/.
- The Online Encyclopedia of Integer Sequences
- Sloane, N.J.A.¹

12
- 0003746050
- Computer Science Press
- WILLIAMSON, S. G. 1985. Combinatorics for Computer Science. Computer Science Press.
- (1985) Combinatorics for Computer Science
- Williamson, S.G.¹

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