Priority queues with decreasing keys

DOI10.1016/J.TCS.2024.114563MaRDI QIDQ6495789zbMATH OpenFDO

Authors Gerth Stølting Brodal

Publication date 2 May 2024

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

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114563

zbMATH Keywords

decreasing keysDijkstra's algorithmpost-order heappriority queue

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A data structure for manipulating priority queues
• A note on two problems in connexion with graphs
• A survey on priority queues
• An applicative random-access stack
• Fast priority queues for cached memory
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 4062572 (Why is no real title available?)
• scientific article; zbMATH DE number 1984681 (Why is no real title available?)
• scientific article; zbMATH DE number 7545254 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Irredundant intervals
• Self-Adjusting Heaps
• The pairing heap: A new form of self-adjusting heap
• Two skew-binary numeral systems and one application

This page was built for publication: Priority queues with decreasing keys

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