Affiliation:
1. Univ. de Paris-Sud, Orsay, France
Abstract
A data structure is described which can be used for representing a collection of priority queues. The primitive operations are insertion, deletion, union, update, and search for an item of earliest priority.
Publisher
Association for Computing Machinery (ACM)
Reference26 articles.
1. Brown M.R. Implementation and analysis of binomial queue algorithms. (to appear in SICOMP). Brown M.R. Implementation and analysis of binomial queue algorithms. (to appear in SICOMP).
Cited by
165 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Tighter bounds on the minimum broadcast time;Discrete Optimization;2024-02
2. On Finding Optimal (Dynamic) Arborescences;Algorithms;2023-12-06
3. Advanced Priority Queues in the OPTICS Clustering Algorithm;2023 International Conference on Information and Digital Technologies (IDT);2023-06-22
4. Search Space Reduction for Efficient Quantum Compilation;Proceedings of the Great Lakes Symposium on VLSI 2023;2023-06-05
5. Design and Evaluation of IoT Gateway for Data Prioritization based on Van Emde Boas Tree;2022 9th International Conference on Future Internet of Things and Cloud (FiCloud);2022-08