Skip Navigation

The Computer Journal 1984 27(4):373-375; doi:10.1093/comjnl/27.4.373
© 1984 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Irving, R. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Notes

Permutation Backtracking in Lexicographic Order

R. W. Irving *

Department of Mathematics, University of Salford, Salford, UK

An algorithm is presented for the lexicographic generation of permutations, which readily lends itself to the conduction of a backtrack search in the space of permutations of a set of items. The method is similar to that employed in an algorithm of Rohl, but achieves lexicographic order at no extra cost by storing unused items throughout in a linked linear list. Following the specification of the permutation generation algorithm itself, its application to backtracking is illustrated with reference to the n-queens problem, and some figures are given to compare its efficiency with that of related algorithms.

Received October 1982.

* Department of Mathematics, University of Salford, Salford M5 4WT, UK


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.