Labelled trees and pairs of input--output permutations in priority queues

DOI10.1016/S0304-3975(97)00037-6zbMath0917.68048OpenAlexW2044960516MaRDI QIDQ1275072

Shmuel Zaks, Mordecai J. Golin

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00037-6

zbMATH Keywords

labelled treestransformation pairs

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Data structures (68P05)

Related Items (3)

Bounded capacity priority queues ⋮ Priority queues with binary priorities ⋮ A five-element transformation monoid on labelled trees

Cites Work

• Unnamed Item
• Unnamed Item
• A data structure for dynamic trees
• Labelled trees and factorizations of a cycle into transpositions
• The permutational power of a priority queue
• Priority Queues and Permutations

This page was built for publication: Labelled trees and pairs of input--output permutations in priority queues