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

DOI10.1007/3-540-59071-4_55MaRDI QIDQ6184377zbMATH OpenOpenAlexFDO

Authors Mordecai J. Golin, Shmuel Zaks

Publication date 5 January 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59071-4_55

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Data structures (68P05) Combinatorics in computer science (68R05)

Recommendations

• Labelled trees and pairs of input--output permutations in priority queues
• The permutational power of a priority queue
• Priority Queues and Permutations
• Priority queue sorting and labeled trees
• Transforming binary sequences using priority queues

Cites work

• A data structure for dynamic trees
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Labelled trees and factorizations of a cycle into transpositions
• The permutational power of a priority queue

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184377)