Labelled trees and pairs of input-output
โ
M. Golin; S. Zaks
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 912 KB
A sequence of priority queue operations can transform a permutation 72 of n elements to some, but not necessarily all, permutations 6. A recent result of Atkinson and Thiyagarajah (1993) states that the number of distinct transformation pairs (TC., a) is (n + l)"-'. By Cayley's theorem this is also