The representation of permutations by trees

Representation of permutations and combinations of N elements in lexicographical order by elements of a tree are considered. An algorithm for generating the nodes is presented and some examples are given. The algorithm could be implemented in any programming language that allows for recursive calls.

Saved in:
Bibliographic Details
Published inComputers & mathematics with applications (1987) Vol. 28; no. 9; pp. 67 - 71
Main Author Bhattacharya, P.
Format Journal Article
LanguageEnglish
Published Oxford Elsevier Ltd 01.11.1994
Elsevier
Subjects
Applied sciences
Classical combinatorial problems
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Exact sciences and technology
Information retrieval. Graph
Mathematics
Sciences and techniques of general use
Theoretical computing
Representation
Tree structure
Permutation
Recursive algorithm
Lexicographic order
Online AccessGet full text

Cover

More Information
Summary:Representation of permutations and combinations of N elements in lexicographical order by elements of a tree are considered. An algorithm for generating the nodes is presented and some examples are given. The algorithm could be implemented in any programming language that allows for recursive calls.
ISSN:0898-1221
1873-7668
DOI:10.1016/0898-1221(94)00178-2