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

Frank Ruskey, Aaron Williams (2010)

> Home

Details and statistics

DOI: 10.1145/1798596.1798598

access: closed

type: Journal Article

metadata version: 2024-07-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/RuskeyW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/RuskeyW10
Frank Ruskey, Aaron Williams:
An explicit universal cycle for the (n-1)-permutations of an n-set. ACM Trans. Algorithms 6(3): 45:1-45:12 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.