Abstract
The concept of ‘heap’ is generalized with respect to the representation of arbitrary partial orders. Lower complexity bounds for find-operations as well as delete — insert — operations in generalized heaps are given. Some special partial orders are analysed.
Cite
CITATION STYLE
APA
Noltemeier, H. (1981). On a generalization of heaps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 100 LNCS, pp. 127–136). Springer Verlag. https://doi.org/10.1007/3-540-10291-4_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free