Priority Queues and Permutations

Abstract

A priority queue transforms an input permutation o of some set of size n into an output permutation r. The set R,, of such related pairs (o’, r) is studied. Efficient algorithms for determining s(r) Icr (o’, r) R,,I and t(o-) Ir (or, r) R,I are given, a new proof that IR,,I (n + 1)’’-I is given, and the transitive closure of R,, 
DOI: 10.1137/S0097539792240893

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics